/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-ext-properties/test-0214_1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:20:08,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:20:08,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:20:08,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:20:08,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:20:08,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:20:08,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:20:08,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:20:08,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:20:08,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:20:08,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:20:08,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:20:08,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:20:08,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:20:08,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:20:08,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:20:08,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:20:08,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:20:08,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:20:08,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:20:08,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:20:08,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:20:08,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:20:08,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:20:08,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:20:08,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:20:08,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:20:08,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:20:08,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:20:08,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:20:09,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:20:09,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:20:09,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:20:09,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:20:09,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:20:09,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:20:09,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:20:09,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:20:09,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:20:09,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:20:09,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:20:09,016 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:20:09,078 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:20:09,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:20:09,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:20:09,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:20:09,085 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:20:09,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:20:09,085 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:20:09,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:20:09,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:20:09,087 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:20:09,089 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:20:09,089 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:20:09,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:20:09,089 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:20:09,090 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:20:09,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:20:09,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:20:09,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:20:09,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:20:09,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:20:09,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:20:09,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:20:09,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:20:09,092 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:20:09,092 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:20:09,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:20:09,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:20:09,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:20:09,706 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:20:09,707 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:20:09,708 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0214_1.i [2021-01-07 05:20:09,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f6a5c7b2d/12eeab1f67a64e28ad336f78a5f581c1/FLAG24f21165d [2021-01-07 05:20:10,668 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:20:10,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0214_1.i [2021-01-07 05:20:10,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f6a5c7b2d/12eeab1f67a64e28ad336f78a5f581c1/FLAG24f21165d [2021-01-07 05:20:10,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f6a5c7b2d/12eeab1f67a64e28ad336f78a5f581c1 [2021-01-07 05:20:10,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:20:10,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:20:10,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:20:10,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:20:10,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:20:10,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:20:10" (1/1) ... [2021-01-07 05:20:10,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ffa90a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:10, skipping insertion in model container [2021-01-07 05:20:10,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:20:10" (1/1) ... [2021-01-07 05:20:10,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:20:10,968 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~link_field~0,] left hand side expression in assignment: lhs: VariableLHS[~term_field~0,] left hand side expression in assignment: lhs: VariableLHS[~link_field~0,] left hand side expression in assignment: lhs: VariableLHS[~term_field~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~item~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~link_field~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~item~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~term_field~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~item~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~link,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~link,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~term_field~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~list,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~to,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~list,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~unnamed1~0~LIST_BEG,GLOBAL]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~list,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~unnamed1~0~LIST_END,GLOBAL]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~next~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~next~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~term_field~1,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~list,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~from,]]]]] left hand side expression in assignment: lhs: VariableLHS[~y~0,] left hand side expression in assignment: lhs: VariableLHS[~z~0,] left hand side expression in assignment: lhs: VariableLHS[~end_point~0,] left hand side expression in assignment: lhs: VariableLHS[~direction~0,] left hand side expression in assignment: lhs: VariableLHS[~end_point~0,] left hand side expression in assignment: lhs: VariableLHS[~direction~0,] left hand side expression in assignment: lhs: VariableLHS[~cursor~0,] [2021-01-07 05:20:11,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:20:11,608 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~link_field~0,] left hand side expression in assignment: lhs: VariableLHS[~term_field~0,] left hand side expression in assignment: lhs: VariableLHS[~link_field~0,] left hand side expression in assignment: lhs: VariableLHS[~term_field~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~item~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~link_field~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~item~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~term_field~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~item~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~link,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~link,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~term_field~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~list,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~to,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~list,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~unnamed1~0~LIST_BEG,GLOBAL]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~list,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~unnamed1~0~LIST_END,GLOBAL]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~next~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~next~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~term_field~1,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~list,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~from,]]]]] left hand side expression in assignment: lhs: VariableLHS[~y~0,] left hand side expression in assignment: lhs: VariableLHS[~z~0,] left hand side expression in assignment: lhs: VariableLHS[~end_point~0,] left hand side expression in assignment: lhs: VariableLHS[~direction~0,] left hand side expression in assignment: lhs: VariableLHS[~end_point~0,] left hand side expression in assignment: lhs: VariableLHS[~direction~0,] left hand side expression in assignment: lhs: VariableLHS[~cursor~0,] [2021-01-07 05:20:11,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:20:11,772 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:20:11,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:11 WrapperNode [2021-01-07 05:20:11,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:20:11,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:20:11,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:20:11,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:20:11,785 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:20:11" (1/1) ... [2021-01-07 05:20:11,806 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:20:11" (1/1) ... [2021-01-07 05:20:11,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:20:11,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:20:11,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:20:11,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:20:11,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:11" (1/1) ... [2021-01-07 05:20:11,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:11" (1/1) ... [2021-01-07 05:20:11,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:11" (1/1) ... [2021-01-07 05:20:11,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:11" (1/1) ... [2021-01-07 05:20:11,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:11" (1/1) ... [2021-01-07 05:20:11,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:11" (1/1) ... [2021-01-07 05:20:11,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:11" (1/1) ... [2021-01-07 05:20:11,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:20:11,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:20:11,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:20:11,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:20:11,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:11" (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:20:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:20:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:20:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:20:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:20:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:20:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:20:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 05:20:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:20:12,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:20:12,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:20:12,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:20:12,940 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-01-07 05:20:12,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:20:12 BoogieIcfgContainer [2021-01-07 05:20:12,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:20:12,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:20:12,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:20:12,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:20:12,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:20:10" (1/3) ... [2021-01-07 05:20:12,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52ce8888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:20:12, skipping insertion in model container [2021-01-07 05:20:12,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:11" (2/3) ... [2021-01-07 05:20:12,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52ce8888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:20:12, skipping insertion in model container [2021-01-07 05:20:12,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:20:12" (3/3) ... [2021-01-07 05:20:12,954 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0214_1.i [2021-01-07 05:20:12,962 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:20:12,969 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2021-01-07 05:20:12,994 INFO L253 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2021-01-07 05:20:13,021 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:20:13,022 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:20:13,022 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:20:13,022 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:20:13,022 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:20:13,022 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:20:13,022 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:20:13,023 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:20:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2021-01-07 05:20:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-01-07 05:20:13,055 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:13,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-01-07 05:20:13,058 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:13,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:13,066 INFO L82 PathProgramCache]: Analyzing trace with hash 896987242, now seen corresponding path program 1 times [2021-01-07 05:20:13,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:13,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227521518] [2021-01-07 05:20:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:13,260 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:20:13,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227521518] [2021-01-07 05:20:13,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:13,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:13,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406002945] [2021-01-07 05:20:13,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 05:20:13,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:13,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 05:20:13,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 05:20:13,293 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 2 states. [2021-01-07 05:20:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:13,318 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2021-01-07 05:20:13,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 05:20:13,320 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2021-01-07 05:20:13,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:13,333 INFO L225 Difference]: With dead ends: 148 [2021-01-07 05:20:13,333 INFO L226 Difference]: Without dead ends: 145 [2021-01-07 05:20:13,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 05:20:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-01-07 05:20:13,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-01-07 05:20:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2021-01-07 05:20:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2021-01-07 05:20:13,408 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 6 [2021-01-07 05:20:13,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:13,408 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2021-01-07 05:20:13,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 05:20:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2021-01-07 05:20:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:20:13,409 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:13,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:13,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:20:13,410 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:13,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:13,411 INFO L82 PathProgramCache]: Analyzing trace with hash 177917173, now seen corresponding path program 1 times [2021-01-07 05:20:13,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:13,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530556041] [2021-01-07 05:20:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:13,519 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:20:13,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530556041] [2021-01-07 05:20:13,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:13,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-07 05:20:13,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260699064] [2021-01-07 05:20:13,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:20:13,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:13,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:20:13,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:20:13,526 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand 3 states. [2021-01-07 05:20:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:13,793 INFO L93 Difference]: Finished difference Result 280 states and 317 transitions. [2021-01-07 05:20:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:20:13,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2021-01-07 05:20:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:13,798 INFO L225 Difference]: With dead ends: 280 [2021-01-07 05:20:13,798 INFO L226 Difference]: Without dead ends: 280 [2021-01-07 05:20:13,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:20:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-01-07 05:20:13,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 195. [2021-01-07 05:20:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2021-01-07 05:20:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 254 transitions. [2021-01-07 05:20:13,821 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 254 transitions. Word has length 8 [2021-01-07 05:20:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:13,822 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 254 transitions. [2021-01-07 05:20:13,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:20:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 254 transitions. [2021-01-07 05:20:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:20:13,823 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:13,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:13,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:20:13,824 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:13,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:13,825 INFO L82 PathProgramCache]: Analyzing trace with hash 177917174, now seen corresponding path program 1 times [2021-01-07 05:20:13,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:13,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936669910] [2021-01-07 05:20:13,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:13,971 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:20:13,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936669910] [2021-01-07 05:20:13,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:13,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:13,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489237609] [2021-01-07 05:20:13,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:13,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:13,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:13,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:13,975 INFO L87 Difference]: Start difference. First operand 195 states and 254 transitions. Second operand 4 states. [2021-01-07 05:20:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:14,251 INFO L93 Difference]: Finished difference Result 346 states and 436 transitions. [2021-01-07 05:20:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:14,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-01-07 05:20:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:14,254 INFO L225 Difference]: With dead ends: 346 [2021-01-07 05:20:14,254 INFO L226 Difference]: Without dead ends: 346 [2021-01-07 05:20:14,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:20:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-01-07 05:20:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 272. [2021-01-07 05:20:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2021-01-07 05:20:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 389 transitions. [2021-01-07 05:20:14,283 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 389 transitions. Word has length 8 [2021-01-07 05:20:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:14,284 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 389 transitions. [2021-01-07 05:20:14,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 389 transitions. [2021-01-07 05:20:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:20:14,287 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:14,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:14,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:20:14,290 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:14,291 INFO L82 PathProgramCache]: Analyzing trace with hash 177917236, now seen corresponding path program 1 times [2021-01-07 05:20:14,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:14,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396045643] [2021-01-07 05:20:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:14,412 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:20:14,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396045643] [2021-01-07 05:20:14,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:14,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:14,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153434216] [2021-01-07 05:20:14,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:14,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:14,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:14,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:14,416 INFO L87 Difference]: Start difference. First operand 272 states and 389 transitions. Second operand 4 states. [2021-01-07 05:20:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:14,680 INFO L93 Difference]: Finished difference Result 345 states and 434 transitions. [2021-01-07 05:20:14,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:14,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-01-07 05:20:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:14,684 INFO L225 Difference]: With dead ends: 345 [2021-01-07 05:20:14,684 INFO L226 Difference]: Without dead ends: 345 [2021-01-07 05:20:14,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:20:14,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-01-07 05:20:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 272. [2021-01-07 05:20:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2021-01-07 05:20:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 389 transitions. [2021-01-07 05:20:14,699 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 389 transitions. Word has length 8 [2021-01-07 05:20:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:14,700 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 389 transitions. [2021-01-07 05:20:14,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 389 transitions. [2021-01-07 05:20:14,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:20:14,701 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:14,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:14,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:20:14,701 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash 341086259, now seen corresponding path program 1 times [2021-01-07 05:20:14,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:14,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130984008] [2021-01-07 05:20:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:14,789 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:20:14,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130984008] [2021-01-07 05:20:14,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:14,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:14,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904047329] [2021-01-07 05:20:14,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:20:14,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:14,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:20:14,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:20:14,792 INFO L87 Difference]: Start difference. First operand 272 states and 389 transitions. Second operand 3 states. [2021-01-07 05:20:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:14,816 INFO L93 Difference]: Finished difference Result 377 states and 491 transitions. [2021-01-07 05:20:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:20:14,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-01-07 05:20:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:14,819 INFO L225 Difference]: With dead ends: 377 [2021-01-07 05:20:14,820 INFO L226 Difference]: Without dead ends: 377 [2021-01-07 05:20:14,820 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:20:14,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-01-07 05:20:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 274. [2021-01-07 05:20:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2021-01-07 05:20:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 389 transitions. [2021-01-07 05:20:14,868 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 389 transitions. Word has length 11 [2021-01-07 05:20:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:14,868 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 389 transitions. [2021-01-07 05:20:14,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:20:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 389 transitions. [2021-01-07 05:20:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:20:14,869 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:14,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:14,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:20:14,870 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:14,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:14,871 INFO L82 PathProgramCache]: Analyzing trace with hash -304260620, now seen corresponding path program 1 times [2021-01-07 05:20:14,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:14,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876801215] [2021-01-07 05:20:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:14,916 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:20:14,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876801215] [2021-01-07 05:20:14,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:14,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:14,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569140744] [2021-01-07 05:20:14,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:14,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:14,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:14,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:14,920 INFO L87 Difference]: Start difference. First operand 274 states and 389 transitions. Second operand 4 states. [2021-01-07 05:20:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:15,271 INFO L93 Difference]: Finished difference Result 494 states and 599 transitions. [2021-01-07 05:20:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:15,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-01-07 05:20:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:15,274 INFO L225 Difference]: With dead ends: 494 [2021-01-07 05:20:15,275 INFO L226 Difference]: Without dead ends: 494 [2021-01-07 05:20:15,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:20:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-01-07 05:20:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 269. [2021-01-07 05:20:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2021-01-07 05:20:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 378 transitions. [2021-01-07 05:20:15,285 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 378 transitions. Word has length 11 [2021-01-07 05:20:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:15,285 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 378 transitions. [2021-01-07 05:20:15,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 378 transitions. [2021-01-07 05:20:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:20:15,286 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:15,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:15,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:20:15,287 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:15,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:15,288 INFO L82 PathProgramCache]: Analyzing trace with hash -304260619, now seen corresponding path program 1 times [2021-01-07 05:20:15,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:15,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218497420] [2021-01-07 05:20:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:15,401 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:20:15,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218497420] [2021-01-07 05:20:15,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:15,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:15,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553159720] [2021-01-07 05:20:15,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:15,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:15,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:15,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:15,417 INFO L87 Difference]: Start difference. First operand 269 states and 378 transitions. Second operand 5 states. [2021-01-07 05:20:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:15,708 INFO L93 Difference]: Finished difference Result 329 states and 413 transitions. [2021-01-07 05:20:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:15,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-01-07 05:20:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:15,711 INFO L225 Difference]: With dead ends: 329 [2021-01-07 05:20:15,711 INFO L226 Difference]: Without dead ends: 329 [2021-01-07 05:20:15,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:20:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-01-07 05:20:15,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 275. [2021-01-07 05:20:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2021-01-07 05:20:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 385 transitions. [2021-01-07 05:20:15,720 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 385 transitions. Word has length 11 [2021-01-07 05:20:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:15,721 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 385 transitions. [2021-01-07 05:20:15,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 385 transitions. [2021-01-07 05:20:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-07 05:20:15,723 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:15,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:15,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:20:15,723 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:15,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:15,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1983738141, now seen corresponding path program 1 times [2021-01-07 05:20:15,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:15,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504062286] [2021-01-07 05:20:15,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:15,791 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:20:15,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504062286] [2021-01-07 05:20:15,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:15,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:15,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083282652] [2021-01-07 05:20:15,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:20:15,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:15,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:20:15,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:20:15,794 INFO L87 Difference]: Start difference. First operand 275 states and 385 transitions. Second operand 3 states. [2021-01-07 05:20:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:15,959 INFO L93 Difference]: Finished difference Result 330 states and 438 transitions. [2021-01-07 05:20:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:20:15,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2021-01-07 05:20:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:15,962 INFO L225 Difference]: With dead ends: 330 [2021-01-07 05:20:15,963 INFO L226 Difference]: Without dead ends: 323 [2021-01-07 05:20:15,963 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:20:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-01-07 05:20:15,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 272. [2021-01-07 05:20:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2021-01-07 05:20:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 380 transitions. [2021-01-07 05:20:15,973 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 380 transitions. Word has length 12 [2021-01-07 05:20:15,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:15,974 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 380 transitions. [2021-01-07 05:20:15,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:20:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 380 transitions. [2021-01-07 05:20:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-07 05:20:15,975 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:15,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:15,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:20:15,976 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:15,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1108273255, now seen corresponding path program 1 times [2021-01-07 05:20:15,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:15,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063221116] [2021-01-07 05:20:15,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:16,014 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:20:16,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063221116] [2021-01-07 05:20:16,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:16,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:16,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976589439] [2021-01-07 05:20:16,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:16,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:16,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:16,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:16,018 INFO L87 Difference]: Start difference. First operand 272 states and 380 transitions. Second operand 4 states. [2021-01-07 05:20:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:16,335 INFO L93 Difference]: Finished difference Result 601 states and 781 transitions. [2021-01-07 05:20:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:16,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2021-01-07 05:20:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:16,339 INFO L225 Difference]: With dead ends: 601 [2021-01-07 05:20:16,339 INFO L226 Difference]: Without dead ends: 601 [2021-01-07 05:20:16,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:20:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2021-01-07 05:20:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 270. [2021-01-07 05:20:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2021-01-07 05:20:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 372 transitions. [2021-01-07 05:20:16,349 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 372 transitions. Word has length 14 [2021-01-07 05:20:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:16,350 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 372 transitions. [2021-01-07 05:20:16,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:16,350 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 372 transitions. [2021-01-07 05:20:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-07 05:20:16,350 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:16,351 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:16,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 05:20:16,351 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1108273254, now seen corresponding path program 1 times [2021-01-07 05:20:16,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:16,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224144688] [2021-01-07 05:20:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:16,421 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:20:16,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224144688] [2021-01-07 05:20:16,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:16,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:16,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800073817] [2021-01-07 05:20:16,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:16,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:16,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:16,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:16,424 INFO L87 Difference]: Start difference. First operand 270 states and 372 transitions. Second operand 4 states. [2021-01-07 05:20:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:16,628 INFO L93 Difference]: Finished difference Result 317 states and 392 transitions. [2021-01-07 05:20:16,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:16,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2021-01-07 05:20:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:16,633 INFO L225 Difference]: With dead ends: 317 [2021-01-07 05:20:16,634 INFO L226 Difference]: Without dead ends: 317 [2021-01-07 05:20:16,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:20:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-01-07 05:20:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 270. [2021-01-07 05:20:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2021-01-07 05:20:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 367 transitions. [2021-01-07 05:20:16,641 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 367 transitions. Word has length 14 [2021-01-07 05:20:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:16,642 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 367 transitions. [2021-01-07 05:20:16,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 367 transitions. [2021-01-07 05:20:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:20:16,644 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:16,644 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:16,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 05:20:16,645 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:16,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash -453866402, now seen corresponding path program 1 times [2021-01-07 05:20:16,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:16,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278754850] [2021-01-07 05:20:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:16,709 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:20:16,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278754850] [2021-01-07 05:20:16,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:16,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:16,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255541308] [2021-01-07 05:20:16,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:20:16,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:16,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:20:16,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:20:16,714 INFO L87 Difference]: Start difference. First operand 270 states and 367 transitions. Second operand 3 states. [2021-01-07 05:20:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:16,874 INFO L93 Difference]: Finished difference Result 364 states and 471 transitions. [2021-01-07 05:20:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:20:16,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2021-01-07 05:20:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:16,878 INFO L225 Difference]: With dead ends: 364 [2021-01-07 05:20:16,878 INFO L226 Difference]: Without dead ends: 364 [2021-01-07 05:20:16,878 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:20:16,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-01-07 05:20:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 267. [2021-01-07 05:20:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2021-01-07 05:20:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 361 transitions. [2021-01-07 05:20:16,886 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 361 transitions. Word has length 17 [2021-01-07 05:20:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:16,887 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 361 transitions. [2021-01-07 05:20:16,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:20:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 361 transitions. [2021-01-07 05:20:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:20:16,889 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:16,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:16,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:20:16,890 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:16,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:16,891 INFO L82 PathProgramCache]: Analyzing trace with hash -453866401, now seen corresponding path program 1 times [2021-01-07 05:20:16,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:16,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810671207] [2021-01-07 05:20:16,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:17,020 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:20:17,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810671207] [2021-01-07 05:20:17,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:17,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:17,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856655715] [2021-01-07 05:20:17,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:17,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:17,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:17,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:17,024 INFO L87 Difference]: Start difference. First operand 267 states and 361 transitions. Second operand 4 states. [2021-01-07 05:20:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:17,278 INFO L93 Difference]: Finished difference Result 470 states and 578 transitions. [2021-01-07 05:20:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:17,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2021-01-07 05:20:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:17,282 INFO L225 Difference]: With dead ends: 470 [2021-01-07 05:20:17,282 INFO L226 Difference]: Without dead ends: 470 [2021-01-07 05:20:17,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-01-07 05:20:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 270. [2021-01-07 05:20:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2021-01-07 05:20:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 363 transitions. [2021-01-07 05:20:17,292 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 363 transitions. Word has length 17 [2021-01-07 05:20:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:17,293 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 363 transitions. [2021-01-07 05:20:17,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 363 transitions. [2021-01-07 05:20:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:20:17,294 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:17,294 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:20:17,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:20:17,294 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:17,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1184956534, now seen corresponding path program 1 times [2021-01-07 05:20:17,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:17,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685507746] [2021-01-07 05:20:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:17,361 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:20:17,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685507746] [2021-01-07 05:20:17,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:17,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:17,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814087060] [2021-01-07 05:20:17,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:17,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:17,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:17,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:17,364 INFO L87 Difference]: Start difference. First operand 270 states and 363 transitions. Second operand 4 states. [2021-01-07 05:20:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:17,567 INFO L93 Difference]: Finished difference Result 469 states and 576 transitions. [2021-01-07 05:20:17,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:17,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2021-01-07 05:20:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:17,570 INFO L225 Difference]: With dead ends: 469 [2021-01-07 05:20:17,571 INFO L226 Difference]: Without dead ends: 469 [2021-01-07 05:20:17,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-01-07 05:20:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 272. [2021-01-07 05:20:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2021-01-07 05:20:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 365 transitions. [2021-01-07 05:20:17,579 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 365 transitions. Word has length 18 [2021-01-07 05:20:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:17,580 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 365 transitions. [2021-01-07 05:20:17,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2021-01-07 05:20:17,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:20:17,581 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:17,581 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:20:17,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:20:17,581 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:17,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1184900830, now seen corresponding path program 1 times [2021-01-07 05:20:17,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:17,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392177598] [2021-01-07 05:20:17,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:17,659 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:20:17,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392177598] [2021-01-07 05:20:17,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:17,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:20:17,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320147579] [2021-01-07 05:20:17,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:17,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:17,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:17,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:17,662 INFO L87 Difference]: Start difference. First operand 272 states and 365 transitions. Second operand 6 states. [2021-01-07 05:20:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:17,759 INFO L93 Difference]: Finished difference Result 313 states and 382 transitions. [2021-01-07 05:20:17,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:20:17,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-01-07 05:20:17,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:17,761 INFO L225 Difference]: With dead ends: 313 [2021-01-07 05:20:17,761 INFO L226 Difference]: Without dead ends: 313 [2021-01-07 05:20:17,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:20:17,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-01-07 05:20:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 272. [2021-01-07 05:20:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2021-01-07 05:20:17,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 363 transitions. [2021-01-07 05:20:17,768 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 363 transitions. Word has length 18 [2021-01-07 05:20:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:17,769 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 363 transitions. [2021-01-07 05:20:17,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 363 transitions. [2021-01-07 05:20:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:20:17,770 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:17,770 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:20:17,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 05:20:17,770 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:17,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1184898908, now seen corresponding path program 1 times [2021-01-07 05:20:17,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:17,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017254717] [2021-01-07 05:20:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:17,846 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:20:17,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017254717] [2021-01-07 05:20:17,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:17,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:20:17,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722548161] [2021-01-07 05:20:17,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:17,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:17,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:17,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:17,849 INFO L87 Difference]: Start difference. First operand 272 states and 363 transitions. Second operand 6 states. [2021-01-07 05:20:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:17,937 INFO L93 Difference]: Finished difference Result 303 states and 368 transitions. [2021-01-07 05:20:17,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:20:17,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-01-07 05:20:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:17,939 INFO L225 Difference]: With dead ends: 303 [2021-01-07 05:20:17,940 INFO L226 Difference]: Without dead ends: 303 [2021-01-07 05:20:17,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:20:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-01-07 05:20:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 262. [2021-01-07 05:20:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-07 05:20:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 349 transitions. [2021-01-07 05:20:17,947 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 349 transitions. Word has length 18 [2021-01-07 05:20:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:17,947 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 349 transitions. [2021-01-07 05:20:17,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 349 transitions. [2021-01-07 05:20:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:20:17,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:17,948 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:20:17,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 05:20:17,948 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:17,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:17,949 INFO L82 PathProgramCache]: Analyzing trace with hash -617496579, now seen corresponding path program 1 times [2021-01-07 05:20:17,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:17,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149022820] [2021-01-07 05:20:17,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:18,491 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:20:18,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149022820] [2021-01-07 05:20:18,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:18,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:20:18,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658907128] [2021-01-07 05:20:18,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:20:18,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:18,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:20:18,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:20:18,494 INFO L87 Difference]: Start difference. First operand 262 states and 349 transitions. Second operand 9 states. [2021-01-07 05:20:18,762 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-01-07 05:20:19,070 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2021-01-07 05:20:19,214 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-01-07 05:20:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:19,607 INFO L93 Difference]: Finished difference Result 373 states and 479 transitions. [2021-01-07 05:20:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:20:19,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2021-01-07 05:20:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:19,613 INFO L225 Difference]: With dead ends: 373 [2021-01-07 05:20:19,613 INFO L226 Difference]: Without dead ends: 372 [2021-01-07 05:20:19,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-01-07 05:20:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-01-07 05:20:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 309. [2021-01-07 05:20:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2021-01-07 05:20:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 419 transitions. [2021-01-07 05:20:19,625 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 419 transitions. Word has length 20 [2021-01-07 05:20:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:19,625 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 419 transitions. [2021-01-07 05:20:19,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:20:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 419 transitions. [2021-01-07 05:20:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:20:19,626 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:19,626 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:20:19,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:20:19,627 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:19,627 INFO L82 PathProgramCache]: Analyzing trace with hash -701085048, now seen corresponding path program 1 times [2021-01-07 05:20:19,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:19,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990856823] [2021-01-07 05:20:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:19,723 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:20:19,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990856823] [2021-01-07 05:20:19,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:19,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:19,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615326996] [2021-01-07 05:20:19,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:19,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:19,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:19,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:19,726 INFO L87 Difference]: Start difference. First operand 309 states and 419 transitions. Second operand 5 states. [2021-01-07 05:20:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:19,938 INFO L93 Difference]: Finished difference Result 493 states and 638 transitions. [2021-01-07 05:20:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:19,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2021-01-07 05:20:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:19,942 INFO L225 Difference]: With dead ends: 493 [2021-01-07 05:20:19,942 INFO L226 Difference]: Without dead ends: 493 [2021-01-07 05:20:19,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-01-07 05:20:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 313. [2021-01-07 05:20:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2021-01-07 05:20:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 420 transitions. [2021-01-07 05:20:19,952 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 420 transitions. Word has length 22 [2021-01-07 05:20:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:19,953 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 420 transitions. [2021-01-07 05:20:19,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 420 transitions. [2021-01-07 05:20:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:20:19,955 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:19,956 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:20:19,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 05:20:19,958 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash -701085047, now seen corresponding path program 1 times [2021-01-07 05:20:19,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:19,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372176657] [2021-01-07 05:20:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:20,060 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:20:20,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372176657] [2021-01-07 05:20:20,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:20,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:20,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386755005] [2021-01-07 05:20:20,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:20,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:20,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:20,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:20,068 INFO L87 Difference]: Start difference. First operand 313 states and 420 transitions. Second operand 4 states. [2021-01-07 05:20:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:20,277 INFO L93 Difference]: Finished difference Result 358 states and 445 transitions. [2021-01-07 05:20:20,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:20,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2021-01-07 05:20:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:20,281 INFO L225 Difference]: With dead ends: 358 [2021-01-07 05:20:20,282 INFO L226 Difference]: Without dead ends: 358 [2021-01-07 05:20:20,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:20:20,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-01-07 05:20:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 313. [2021-01-07 05:20:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2021-01-07 05:20:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 413 transitions. [2021-01-07 05:20:20,293 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 413 transitions. Word has length 22 [2021-01-07 05:20:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:20,293 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 413 transitions. [2021-01-07 05:20:20,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 413 transitions. [2021-01-07 05:20:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:20:20,297 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:20,297 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:20:20,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:20:20,298 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:20,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash -345646707, now seen corresponding path program 1 times [2021-01-07 05:20:20,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:20,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695558025] [2021-01-07 05:20:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:20,564 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:20:20,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695558025] [2021-01-07 05:20:20,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:20,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:20:20,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469885410] [2021-01-07 05:20:20,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:20:20,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:20,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:20:20,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:20:20,571 INFO L87 Difference]: Start difference. First operand 313 states and 413 transitions. Second operand 8 states. [2021-01-07 05:20:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:21,075 INFO L93 Difference]: Finished difference Result 570 states and 722 transitions. [2021-01-07 05:20:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:20:21,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2021-01-07 05:20:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:21,079 INFO L225 Difference]: With dead ends: 570 [2021-01-07 05:20:21,079 INFO L226 Difference]: Without dead ends: 570 [2021-01-07 05:20:21,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:20:21,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-01-07 05:20:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 376. [2021-01-07 05:20:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2021-01-07 05:20:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 496 transitions. [2021-01-07 05:20:21,090 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 496 transitions. Word has length 22 [2021-01-07 05:20:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:21,092 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 496 transitions. [2021-01-07 05:20:21,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:20:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 496 transitions. [2021-01-07 05:20:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:20:21,093 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:21,093 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] [2021-01-07 05:20:21,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 05:20:21,093 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:21,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:21,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1453847088, now seen corresponding path program 1 times [2021-01-07 05:20:21,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:21,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64796086] [2021-01-07 05:20:21,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:21,199 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:20:21,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64796086] [2021-01-07 05:20:21,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:21,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:21,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298011467] [2021-01-07 05:20:21,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:21,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:21,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:21,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:21,201 INFO L87 Difference]: Start difference. First operand 376 states and 496 transitions. Second operand 6 states. [2021-01-07 05:20:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:21,755 INFO L93 Difference]: Finished difference Result 582 states and 717 transitions. [2021-01-07 05:20:21,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:20:21,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2021-01-07 05:20:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:21,759 INFO L225 Difference]: With dead ends: 582 [2021-01-07 05:20:21,759 INFO L226 Difference]: Without dead ends: 582 [2021-01-07 05:20:21,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:20:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-01-07 05:20:21,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 376. [2021-01-07 05:20:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2021-01-07 05:20:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 495 transitions. [2021-01-07 05:20:21,769 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 495 transitions. Word has length 24 [2021-01-07 05:20:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:21,769 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 495 transitions. [2021-01-07 05:20:21,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 495 transitions. [2021-01-07 05:20:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 05:20:21,770 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:21,770 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] [2021-01-07 05:20:21,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 05:20:21,770 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:21,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:21,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2119586737, now seen corresponding path program 1 times [2021-01-07 05:20:21,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:21,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042184075] [2021-01-07 05:20:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:21,853 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:20:21,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042184075] [2021-01-07 05:20:21,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:21,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:21,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17102118] [2021-01-07 05:20:21,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:21,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:21,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:21,856 INFO L87 Difference]: Start difference. First operand 376 states and 495 transitions. Second operand 6 states. [2021-01-07 05:20:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:22,010 INFO L93 Difference]: Finished difference Result 395 states and 493 transitions. [2021-01-07 05:20:22,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:22,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2021-01-07 05:20:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:22,016 INFO L225 Difference]: With dead ends: 395 [2021-01-07 05:20:22,016 INFO L226 Difference]: Without dead ends: 395 [2021-01-07 05:20:22,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:20:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-01-07 05:20:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 374. [2021-01-07 05:20:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2021-01-07 05:20:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 491 transitions. [2021-01-07 05:20:22,026 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 491 transitions. Word has length 25 [2021-01-07 05:20:22,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:22,026 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 491 transitions. [2021-01-07 05:20:22,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 491 transitions. [2021-01-07 05:20:22,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:20:22,027 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:22,027 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] [2021-01-07 05:20:22,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 05:20:22,027 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:22,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:22,028 INFO L82 PathProgramCache]: Analyzing trace with hash -440365681, now seen corresponding path program 1 times [2021-01-07 05:20:22,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:22,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848326190] [2021-01-07 05:20:22,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:22,109 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:20:22,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848326190] [2021-01-07 05:20:22,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:22,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:22,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586874161] [2021-01-07 05:20:22,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:22,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:22,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:22,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:22,111 INFO L87 Difference]: Start difference. First operand 374 states and 491 transitions. Second operand 5 states. [2021-01-07 05:20:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:22,275 INFO L93 Difference]: Finished difference Result 433 states and 549 transitions. [2021-01-07 05:20:22,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:20:22,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2021-01-07 05:20:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:22,280 INFO L225 Difference]: With dead ends: 433 [2021-01-07 05:20:22,280 INFO L226 Difference]: Without dead ends: 433 [2021-01-07 05:20:22,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 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:20:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-01-07 05:20:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 374. [2021-01-07 05:20:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2021-01-07 05:20:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 489 transitions. [2021-01-07 05:20:22,289 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 489 transitions. Word has length 26 [2021-01-07 05:20:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:22,289 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 489 transitions. [2021-01-07 05:20:22,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 489 transitions. [2021-01-07 05:20:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:20:22,290 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:22,290 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] [2021-01-07 05:20:22,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 05:20:22,290 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:22,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash -766434009, now seen corresponding path program 1 times [2021-01-07 05:20:22,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:22,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256264106] [2021-01-07 05:20:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:22,392 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:20:22,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256264106] [2021-01-07 05:20:22,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:22,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:22,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772249738] [2021-01-07 05:20:22,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:22,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:22,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:22,395 INFO L87 Difference]: Start difference. First operand 374 states and 489 transitions. Second operand 5 states. [2021-01-07 05:20:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:22,635 INFO L93 Difference]: Finished difference Result 481 states and 612 transitions. [2021-01-07 05:20:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:22,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2021-01-07 05:20:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:22,639 INFO L225 Difference]: With dead ends: 481 [2021-01-07 05:20:22,639 INFO L226 Difference]: Without dead ends: 481 [2021-01-07 05:20:22,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 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:20:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-01-07 05:20:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 414. [2021-01-07 05:20:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2021-01-07 05:20:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 542 transitions. [2021-01-07 05:20:22,648 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 542 transitions. Word has length 27 [2021-01-07 05:20:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:22,648 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 542 transitions. [2021-01-07 05:20:22,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:22,648 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 542 transitions. [2021-01-07 05:20:22,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:20:22,649 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:22,649 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] [2021-01-07 05:20:22,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-07 05:20:22,649 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:22,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:22,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1108354639, now seen corresponding path program 1 times [2021-01-07 05:20:22,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:22,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072834516] [2021-01-07 05:20:22,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:22,743 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:20:22,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072834516] [2021-01-07 05:20:22,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:22,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:22,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272674028] [2021-01-07 05:20:22,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:22,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:22,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:22,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:22,745 INFO L87 Difference]: Start difference. First operand 414 states and 542 transitions. Second operand 5 states. [2021-01-07 05:20:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:23,261 INFO L93 Difference]: Finished difference Result 613 states and 756 transitions. [2021-01-07 05:20:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:23,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2021-01-07 05:20:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:23,266 INFO L225 Difference]: With dead ends: 613 [2021-01-07 05:20:23,266 INFO L226 Difference]: Without dead ends: 613 [2021-01-07 05:20:23,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-01-07 05:20:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 414. [2021-01-07 05:20:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2021-01-07 05:20:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 540 transitions. [2021-01-07 05:20:23,278 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 540 transitions. Word has length 27 [2021-01-07 05:20:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:23,279 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 540 transitions. [2021-01-07 05:20:23,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 540 transitions. [2021-01-07 05:20:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:20:23,280 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:23,280 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] [2021-01-07 05:20:23,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 05:20:23,280 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:23,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2103668119, now seen corresponding path program 1 times [2021-01-07 05:20:23,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:23,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312762885] [2021-01-07 05:20:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:23,361 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:20:23,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312762885] [2021-01-07 05:20:23,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:23,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:23,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811735158] [2021-01-07 05:20:23,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:20:23,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:23,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:20:23,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:20:23,363 INFO L87 Difference]: Start difference. First operand 414 states and 540 transitions. Second operand 7 states. [2021-01-07 05:20:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:24,079 INFO L93 Difference]: Finished difference Result 975 states and 1232 transitions. [2021-01-07 05:20:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:20:24,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2021-01-07 05:20:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:24,085 INFO L225 Difference]: With dead ends: 975 [2021-01-07 05:20:24,085 INFO L226 Difference]: Without dead ends: 975 [2021-01-07 05:20:24,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:20:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2021-01-07 05:20:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 438. [2021-01-07 05:20:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2021-01-07 05:20:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 573 transitions. [2021-01-07 05:20:24,099 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 573 transitions. Word has length 29 [2021-01-07 05:20:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:24,100 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 573 transitions. [2021-01-07 05:20:24,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:20:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 573 transitions. [2021-01-07 05:20:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:20:24,100 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:24,100 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] [2021-01-07 05:20:24,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-07 05:20:24,101 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1421338962, now seen corresponding path program 1 times [2021-01-07 05:20:24,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:24,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834046520] [2021-01-07 05:20:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:24,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:20:24,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834046520] [2021-01-07 05:20:24,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:24,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:24,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870122996] [2021-01-07 05:20:24,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:24,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:24,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:24,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:24,159 INFO L87 Difference]: Start difference. First operand 438 states and 573 transitions. Second operand 4 states. [2021-01-07 05:20:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:24,198 INFO L93 Difference]: Finished difference Result 526 states and 676 transitions. [2021-01-07 05:20:24,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:24,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2021-01-07 05:20:24,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:24,201 INFO L225 Difference]: With dead ends: 526 [2021-01-07 05:20:24,201 INFO L226 Difference]: Without dead ends: 526 [2021-01-07 05:20:24,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 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:20:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-01-07 05:20:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 438. [2021-01-07 05:20:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2021-01-07 05:20:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 571 transitions. [2021-01-07 05:20:24,212 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 571 transitions. Word has length 29 [2021-01-07 05:20:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:24,212 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 571 transitions. [2021-01-07 05:20:24,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 571 transitions. [2021-01-07 05:20:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:20:24,213 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:24,213 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] [2021-01-07 05:20:24,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-07 05:20:24,214 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:24,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1421337040, now seen corresponding path program 1 times [2021-01-07 05:20:24,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:24,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314250076] [2021-01-07 05:20:24,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:24,311 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:20:24,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314250076] [2021-01-07 05:20:24,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:24,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:24,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671574436] [2021-01-07 05:20:24,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:24,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:24,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:24,314 INFO L87 Difference]: Start difference. First operand 438 states and 571 transitions. Second operand 6 states. [2021-01-07 05:20:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:24,584 INFO L93 Difference]: Finished difference Result 625 states and 805 transitions. [2021-01-07 05:20:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:20:24,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2021-01-07 05:20:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:24,589 INFO L225 Difference]: With dead ends: 625 [2021-01-07 05:20:24,589 INFO L226 Difference]: Without dead ends: 625 [2021-01-07 05:20:24,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:20:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-01-07 05:20:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 436. [2021-01-07 05:20:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2021-01-07 05:20:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 567 transitions. [2021-01-07 05:20:24,603 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 567 transitions. Word has length 29 [2021-01-07 05:20:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:24,603 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 567 transitions. [2021-01-07 05:20:24,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 567 transitions. [2021-01-07 05:20:24,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 05:20:24,604 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:24,604 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:24,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-07 05:20:24,604 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:24,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:24,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1180806335, now seen corresponding path program 1 times [2021-01-07 05:20:24,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:24,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439007479] [2021-01-07 05:20:24,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:20:25,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439007479] [2021-01-07 05:20:25,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:25,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 05:20:25,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124238016] [2021-01-07 05:20:25,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 05:20:25,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:25,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 05:20:25,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:20:25,148 INFO L87 Difference]: Start difference. First operand 436 states and 567 transitions. Second operand 11 states. [2021-01-07 05:20:25,417 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-01-07 05:20:25,561 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2021-01-07 05:20:25,740 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2021-01-07 05:20:25,898 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2021-01-07 05:20:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:26,315 INFO L93 Difference]: Finished difference Result 509 states and 645 transitions. [2021-01-07 05:20:26,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 05:20:26,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2021-01-07 05:20:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:26,318 INFO L225 Difference]: With dead ends: 509 [2021-01-07 05:20:26,319 INFO L226 Difference]: Without dead ends: 508 [2021-01-07 05:20:26,319 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:20:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-01-07 05:20:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 374. [2021-01-07 05:20:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2021-01-07 05:20:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 485 transitions. [2021-01-07 05:20:26,329 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 485 transitions. Word has length 30 [2021-01-07 05:20:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:26,329 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 485 transitions. [2021-01-07 05:20:26,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 05:20:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 485 transitions. [2021-01-07 05:20:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 05:20:26,330 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:26,330 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] [2021-01-07 05:20:26,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-07 05:20:26,331 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:26,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:26,332 INFO L82 PathProgramCache]: Analyzing trace with hash -789202029, now seen corresponding path program 1 times [2021-01-07 05:20:26,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:26,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412350619] [2021-01-07 05:20:26,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:26,412 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:20:26,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412350619] [2021-01-07 05:20:26,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:26,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:26,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714337971] [2021-01-07 05:20:26,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:26,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:26,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:26,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:26,415 INFO L87 Difference]: Start difference. First operand 374 states and 485 transitions. Second operand 5 states. [2021-01-07 05:20:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:26,735 INFO L93 Difference]: Finished difference Result 486 states and 593 transitions. [2021-01-07 05:20:26,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:26,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2021-01-07 05:20:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:26,739 INFO L225 Difference]: With dead ends: 486 [2021-01-07 05:20:26,739 INFO L226 Difference]: Without dead ends: 486 [2021-01-07 05:20:26,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:20:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-01-07 05:20:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 374. [2021-01-07 05:20:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2021-01-07 05:20:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 482 transitions. [2021-01-07 05:20:26,764 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 482 transitions. Word has length 30 [2021-01-07 05:20:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:26,764 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 482 transitions. [2021-01-07 05:20:26,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 482 transitions. [2021-01-07 05:20:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:20:26,765 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:26,765 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:20:26,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-07 05:20:26,766 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:26,767 INFO L82 PathProgramCache]: Analyzing trace with hash -105290256, now seen corresponding path program 1 times [2021-01-07 05:20:26,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:26,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555557473] [2021-01-07 05:20:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:26,958 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:20:26,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555557473] [2021-01-07 05:20:26,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:26,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:26,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557841462] [2021-01-07 05:20:26,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:26,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:26,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:26,961 INFO L87 Difference]: Start difference. First operand 374 states and 482 transitions. Second operand 6 states. [2021-01-07 05:20:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:27,223 INFO L93 Difference]: Finished difference Result 407 states and 515 transitions. [2021-01-07 05:20:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:20:27,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2021-01-07 05:20:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:27,226 INFO L225 Difference]: With dead ends: 407 [2021-01-07 05:20:27,226 INFO L226 Difference]: Without dead ends: 407 [2021-01-07 05:20:27,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:20:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-01-07 05:20:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 374. [2021-01-07 05:20:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2021-01-07 05:20:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 480 transitions. [2021-01-07 05:20:27,235 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 480 transitions. Word has length 31 [2021-01-07 05:20:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:27,235 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 480 transitions. [2021-01-07 05:20:27,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:27,235 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 480 transitions. [2021-01-07 05:20:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:20:27,236 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:27,236 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:27,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-07 05:20:27,236 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:27,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2107767462, now seen corresponding path program 1 times [2021-01-07 05:20:27,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:27,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952635117] [2021-01-07 05:20:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:27,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952635117] [2021-01-07 05:20:27,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087289077] [2021-01-07 05:20:27,542 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:20:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:27,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-07 05:20:27,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:28,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:28,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2021-01-07 05:20:28,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857953583] [2021-01-07 05:20:28,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-07 05:20:28,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:28,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-07 05:20:28,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:20:28,011 INFO L87 Difference]: Start difference. First operand 374 states and 480 transitions. Second operand 18 states. [2021-01-07 05:20:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:28,337 INFO L93 Difference]: Finished difference Result 400 states and 493 transitions. [2021-01-07 05:20:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:20:28,338 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2021-01-07 05:20:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:28,341 INFO L225 Difference]: With dead ends: 400 [2021-01-07 05:20:28,342 INFO L226 Difference]: Without dead ends: 400 [2021-01-07 05:20:28,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:20:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-01-07 05:20:28,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 367. [2021-01-07 05:20:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2021-01-07 05:20:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 471 transitions. [2021-01-07 05:20:28,352 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 471 transitions. Word has length 35 [2021-01-07 05:20:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:28,352 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 471 transitions. [2021-01-07 05:20:28,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-07 05:20:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 471 transitions. [2021-01-07 05:20:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:20:28,353 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:28,353 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:28,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-01-07 05:20:28,568 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:28,569 INFO L82 PathProgramCache]: Analyzing trace with hash 660239893, now seen corresponding path program 1 times [2021-01-07 05:20:28,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:28,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007812286] [2021-01-07 05:20:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:28,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:28,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007812286] [2021-01-07 05:20:28,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:28,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:28,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69355620] [2021-01-07 05:20:28,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:28,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:28,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:28,718 INFO L87 Difference]: Start difference. First operand 367 states and 471 transitions. Second operand 6 states. [2021-01-07 05:20:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:28,973 INFO L93 Difference]: Finished difference Result 457 states and 563 transitions. [2021-01-07 05:20:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:20:28,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2021-01-07 05:20:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:28,977 INFO L225 Difference]: With dead ends: 457 [2021-01-07 05:20:28,977 INFO L226 Difference]: Without dead ends: 457 [2021-01-07 05:20:28,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:20:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-01-07 05:20:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 365. [2021-01-07 05:20:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2021-01-07 05:20:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 467 transitions. [2021-01-07 05:20:28,991 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 467 transitions. Word has length 38 [2021-01-07 05:20:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:28,991 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 467 transitions. [2021-01-07 05:20:28,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 467 transitions. [2021-01-07 05:20:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:20:28,992 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:28,992 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:28,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-07 05:20:28,993 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:28,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:28,993 INFO L82 PathProgramCache]: Analyzing trace with hash 575285763, now seen corresponding path program 1 times [2021-01-07 05:20:28,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:28,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186766023] [2021-01-07 05:20:28,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:29,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186766023] [2021-01-07 05:20:29,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:29,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:29,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243907652] [2021-01-07 05:20:29,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:29,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:29,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:29,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:29,068 INFO L87 Difference]: Start difference. First operand 365 states and 467 transitions. Second operand 4 states. [2021-01-07 05:20:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:29,086 INFO L93 Difference]: Finished difference Result 437 states and 545 transitions. [2021-01-07 05:20:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:29,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2021-01-07 05:20:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:29,089 INFO L225 Difference]: With dead ends: 437 [2021-01-07 05:20:29,089 INFO L226 Difference]: Without dead ends: 437 [2021-01-07 05:20:29,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-01-07 05:20:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 322. [2021-01-07 05:20:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2021-01-07 05:20:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 413 transitions. [2021-01-07 05:20:29,098 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 413 transitions. Word has length 40 [2021-01-07 05:20:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:29,098 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 413 transitions. [2021-01-07 05:20:29,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 413 transitions. [2021-01-07 05:20:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 05:20:29,099 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:29,099 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:29,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-07 05:20:29,099 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:29,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:29,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1668985443, now seen corresponding path program 1 times [2021-01-07 05:20:29,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:29,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72518610] [2021-01-07 05:20:29,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:20:29,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72518610] [2021-01-07 05:20:29,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269626910] [2021-01-07 05:20:29,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:29,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 05:20:29,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:29,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:29,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2021-01-07 05:20:29,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917984724] [2021-01-07 05:20:29,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:20:29,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:29,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:20:29,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:20:29,376 INFO L87 Difference]: Start difference. First operand 322 states and 413 transitions. Second operand 10 states. [2021-01-07 05:20:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:30,540 INFO L93 Difference]: Finished difference Result 1006 states and 1233 transitions. [2021-01-07 05:20:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 05:20:30,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2021-01-07 05:20:30,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:30,546 INFO L225 Difference]: With dead ends: 1006 [2021-01-07 05:20:30,546 INFO L226 Difference]: Without dead ends: 1006 [2021-01-07 05:20:30,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:20:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-01-07 05:20:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 418. [2021-01-07 05:20:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-07 05:20:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 541 transitions. [2021-01-07 05:20:30,561 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 541 transitions. Word has length 41 [2021-01-07 05:20:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:30,561 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 541 transitions. [2021-01-07 05:20:30,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:20:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 541 transitions. [2021-01-07 05:20:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 05:20:30,562 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:30,562 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:30,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-01-07 05:20:30,777 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:30,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1799802677, now seen corresponding path program 1 times [2021-01-07 05:20:30,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:30,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511414651] [2021-01-07 05:20:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:31,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:31,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511414651] [2021-01-07 05:20:31,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617605912] [2021-01-07 05:20:31,169 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:20:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:31,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-07 05:20:31,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:31,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:20:31,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2021-01-07 05:20:31,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955732081] [2021-01-07 05:20:31,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:20:31,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:31,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:20:31,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:20:31,492 INFO L87 Difference]: Start difference. First operand 418 states and 541 transitions. Second operand 7 states. [2021-01-07 05:20:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:31,692 INFO L93 Difference]: Finished difference Result 466 states and 572 transitions. [2021-01-07 05:20:31,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:20:31,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2021-01-07 05:20:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:31,695 INFO L225 Difference]: With dead ends: 466 [2021-01-07 05:20:31,695 INFO L226 Difference]: Without dead ends: 466 [2021-01-07 05:20:31,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:20:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-01-07 05:20:31,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 420. [2021-01-07 05:20:31,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2021-01-07 05:20:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 544 transitions. [2021-01-07 05:20:31,706 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 544 transitions. Word has length 42 [2021-01-07 05:20:31,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:31,706 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 544 transitions. [2021-01-07 05:20:31,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:20:31,706 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 544 transitions. [2021-01-07 05:20:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 05:20:31,707 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:31,707 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:31,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-01-07 05:20:31,922 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:31,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:31,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1799802739, now seen corresponding path program 1 times [2021-01-07 05:20:31,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:31,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826717534] [2021-01-07 05:20:31,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:32,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826717534] [2021-01-07 05:20:32,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:32,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:32,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718331861] [2021-01-07 05:20:32,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:20:32,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:32,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:20:32,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:20:32,079 INFO L87 Difference]: Start difference. First operand 420 states and 544 transitions. Second operand 7 states. [2021-01-07 05:20:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:32,310 INFO L93 Difference]: Finished difference Result 465 states and 570 transitions. [2021-01-07 05:20:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:20:32,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2021-01-07 05:20:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:32,313 INFO L225 Difference]: With dead ends: 465 [2021-01-07 05:20:32,313 INFO L226 Difference]: Without dead ends: 465 [2021-01-07 05:20:32,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:20:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-01-07 05:20:32,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 417. [2021-01-07 05:20:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2021-01-07 05:20:32,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 539 transitions. [2021-01-07 05:20:32,323 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 539 transitions. Word has length 42 [2021-01-07 05:20:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:32,323 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 539 transitions. [2021-01-07 05:20:32,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:20:32,324 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 539 transitions. [2021-01-07 05:20:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-07 05:20:32,324 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:32,324 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:32,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-07 05:20:32,325 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:32,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:32,326 INFO L82 PathProgramCache]: Analyzing trace with hash -446906719, now seen corresponding path program 1 times [2021-01-07 05:20:32,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:32,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64475415] [2021-01-07 05:20:32,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 05:20:32,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64475415] [2021-01-07 05:20:32,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:32,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:32,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048924557] [2021-01-07 05:20:32,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:32,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:32,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:32,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:32,424 INFO L87 Difference]: Start difference. First operand 417 states and 539 transitions. Second operand 6 states. [2021-01-07 05:20:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:32,546 INFO L93 Difference]: Finished difference Result 519 states and 640 transitions. [2021-01-07 05:20:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:20:32,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2021-01-07 05:20:32,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:32,549 INFO L225 Difference]: With dead ends: 519 [2021-01-07 05:20:32,550 INFO L226 Difference]: Without dead ends: 519 [2021-01-07 05:20:32,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:20:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-01-07 05:20:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 416. [2021-01-07 05:20:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2021-01-07 05:20:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 538 transitions. [2021-01-07 05:20:32,561 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 538 transitions. Word has length 43 [2021-01-07 05:20:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:32,561 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 538 transitions. [2021-01-07 05:20:32,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 538 transitions. [2021-01-07 05:20:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 05:20:32,562 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:32,562 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:32,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-07 05:20:32,563 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:32,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash -969206216, now seen corresponding path program 1 times [2021-01-07 05:20:32,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:32,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124544420] [2021-01-07 05:20:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:33,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124544420] [2021-01-07 05:20:33,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:33,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 05:20:33,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176183436] [2021-01-07 05:20:33,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 05:20:33,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:33,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 05:20:33,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:20:33,262 INFO L87 Difference]: Start difference. First operand 416 states and 538 transitions. Second operand 11 states. [2021-01-07 05:20:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:34,077 INFO L93 Difference]: Finished difference Result 425 states and 548 transitions. [2021-01-07 05:20:34,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:20:34,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2021-01-07 05:20:34,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:34,081 INFO L225 Difference]: With dead ends: 425 [2021-01-07 05:20:34,081 INFO L226 Difference]: Without dead ends: 425 [2021-01-07 05:20:34,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:20:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-01-07 05:20:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 424. [2021-01-07 05:20:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2021-01-07 05:20:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 547 transitions. [2021-01-07 05:20:34,091 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 547 transitions. Word has length 44 [2021-01-07 05:20:34,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:34,091 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 547 transitions. [2021-01-07 05:20:34,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 05:20:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 547 transitions. [2021-01-07 05:20:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-07 05:20:34,092 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:34,093 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:34,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-07 05:20:34,093 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash 793548038, now seen corresponding path program 1 times [2021-01-07 05:20:34,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:34,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875852663] [2021-01-07 05:20:34,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:35,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875852663] [2021-01-07 05:20:35,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:35,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-07 05:20:35,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033570620] [2021-01-07 05:20:35,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-07 05:20:35,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:35,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-07 05:20:35,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:20:35,205 INFO L87 Difference]: Start difference. First operand 424 states and 547 transitions. Second operand 17 states. [2021-01-07 05:20:36,160 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2021-01-07 05:20:36,376 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2021-01-07 05:20:36,563 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2021-01-07 05:20:36,771 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2021-01-07 05:20:36,966 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2021-01-07 05:20:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:37,493 INFO L93 Difference]: Finished difference Result 891 states and 1107 transitions. [2021-01-07 05:20:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-07 05:20:37,494 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2021-01-07 05:20:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:37,498 INFO L225 Difference]: With dead ends: 891 [2021-01-07 05:20:37,498 INFO L226 Difference]: Without dead ends: 890 [2021-01-07 05:20:37,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=277, Invalid=715, Unknown=0, NotChecked=0, Total=992 [2021-01-07 05:20:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2021-01-07 05:20:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 497. [2021-01-07 05:20:37,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2021-01-07 05:20:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 637 transitions. [2021-01-07 05:20:37,512 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 637 transitions. Word has length 45 [2021-01-07 05:20:37,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:37,512 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 637 transitions. [2021-01-07 05:20:37,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-07 05:20:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 637 transitions. [2021-01-07 05:20:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 05:20:37,513 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:37,514 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:37,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-07 05:20:37,514 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:37,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:37,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1639166842, now seen corresponding path program 1 times [2021-01-07 05:20:37,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:37,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470848879] [2021-01-07 05:20:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:38,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470848879] [2021-01-07 05:20:38,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936566994] [2021-01-07 05:20:38,249 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:20:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:38,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 52 conjunts are in the unsatisfiable core [2021-01-07 05:20:38,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:38,499 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:20:38,500 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:38,511 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:38,512 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:38,512 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-01-07 05:20:38,693 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-07 05:20:38,694 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:38,710 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:38,715 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-07 05:20:38,716 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:38,728 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:38,730 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:38,730 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2021-01-07 05:20:38,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:38,874 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 35 treesize of output 26 [2021-01-07 05:20:38,876 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:38,892 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:38,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:38,899 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 37 treesize of output 28 [2021-01-07 05:20:38,902 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:38,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:38,920 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:20:38,921 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2021-01-07 05:20:39,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:39,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:39,242 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 12 [2021-01-07 05:20:39,244 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:39,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:39,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:39,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:39,271 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:39,272 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 13 [2021-01-07 05:20:39,274 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:39,285 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:39,288 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:39,288 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:93, output treesize:17 [2021-01-07 05:20:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:39,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:20:39,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 24 [2021-01-07 05:20:39,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368763095] [2021-01-07 05:20:39,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-07 05:20:39,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:39,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-07 05:20:39,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2021-01-07 05:20:39,337 INFO L87 Difference]: Start difference. First operand 497 states and 637 transitions. Second operand 15 states. [2021-01-07 05:20:41,057 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2021-01-07 05:20:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:41,605 INFO L93 Difference]: Finished difference Result 852 states and 1047 transitions. [2021-01-07 05:20:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 05:20:41,606 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2021-01-07 05:20:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:41,610 INFO L225 Difference]: With dead ends: 852 [2021-01-07 05:20:41,610 INFO L226 Difference]: Without dead ends: 852 [2021-01-07 05:20:41,611 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=381, Invalid=1259, Unknown=0, NotChecked=0, Total=1640 [2021-01-07 05:20:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2021-01-07 05:20:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 583. [2021-01-07 05:20:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2021-01-07 05:20:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 758 transitions. [2021-01-07 05:20:41,625 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 758 transitions. Word has length 46 [2021-01-07 05:20:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:41,626 INFO L481 AbstractCegarLoop]: Abstraction has 583 states and 758 transitions. [2021-01-07 05:20:41,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-07 05:20:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 758 transitions. [2021-01-07 05:20:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 05:20:41,627 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:41,627 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:41,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-01-07 05:20:41,842 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:41,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:41,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1639166843, now seen corresponding path program 1 times [2021-01-07 05:20:41,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:41,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743562280] [2021-01-07 05:20:41,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:42,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743562280] [2021-01-07 05:20:42,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714219471] [2021-01-07 05:20:42,431 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:20:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:42,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-07 05:20:42,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:42,626 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:20:42,627 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:42,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:42,636 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:42,636 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-01-07 05:20:42,801 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-07 05:20:42,802 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:42,810 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:42,812 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:42,812 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2021-01-07 05:20:42,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:42,934 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2021-01-07 05:20:42,936 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:42,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:42,947 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:20:42,947 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2021-01-07 05:20:43,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:43,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:43,154 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:43,155 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 15 [2021-01-07 05:20:43,156 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:43,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:43,164 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:43,165 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:11 [2021-01-07 05:20:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:43,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:20:43,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25 [2021-01-07 05:20:43,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529400062] [2021-01-07 05:20:43,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-07 05:20:43,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:43,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-07 05:20:43,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:20:43,201 INFO L87 Difference]: Start difference. First operand 583 states and 758 transitions. Second operand 15 states. [2021-01-07 05:20:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:45,717 INFO L93 Difference]: Finished difference Result 855 states and 1062 transitions. [2021-01-07 05:20:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:20:45,718 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2021-01-07 05:20:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:45,721 INFO L225 Difference]: With dead ends: 855 [2021-01-07 05:20:45,722 INFO L226 Difference]: Without dead ends: 855 [2021-01-07 05:20:45,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=457, Invalid=1435, Unknown=0, NotChecked=0, Total=1892 [2021-01-07 05:20:45,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-01-07 05:20:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 610. [2021-01-07 05:20:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2021-01-07 05:20:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 798 transitions. [2021-01-07 05:20:45,737 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 798 transitions. Word has length 46 [2021-01-07 05:20:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:45,737 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 798 transitions. [2021-01-07 05:20:45,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-07 05:20:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 798 transitions. [2021-01-07 05:20:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 05:20:45,738 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:45,738 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:45,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:45,952 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:45,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:45,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1637319800, now seen corresponding path program 1 times [2021-01-07 05:20:45,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:45,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701803739] [2021-01-07 05:20:45,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:46,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701803739] [2021-01-07 05:20:46,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755792005] [2021-01-07 05:20:46,361 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:20:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:46,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjunts are in the unsatisfiable core [2021-01-07 05:20:46,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:46,503 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:20:46,504 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,513 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:46,514 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,515 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-01-07 05:20:46,701 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-07 05:20:46,702 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:46,717 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-07 05:20:46,717 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,727 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:46,730 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:46,730 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:38 [2021-01-07 05:20:46,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:46,936 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-01-07 05:20:46,937 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:46,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:46,957 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:46,958 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-01-07 05:20:46,959 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,968 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:46,970 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,971 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:63, output treesize:17 [2021-01-07 05:20:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:47,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:20:47,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2021-01-07 05:20:47,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820799373] [2021-01-07 05:20:47,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-07 05:20:47,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:47,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-07 05:20:47,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:20:47,004 INFO L87 Difference]: Start difference. First operand 610 states and 798 transitions. Second operand 13 states. [2021-01-07 05:20:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:48,029 INFO L93 Difference]: Finished difference Result 759 states and 940 transitions. [2021-01-07 05:20:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-07 05:20:48,030 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2021-01-07 05:20:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:48,034 INFO L225 Difference]: With dead ends: 759 [2021-01-07 05:20:48,034 INFO L226 Difference]: Without dead ends: 759 [2021-01-07 05:20:48,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:20:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2021-01-07 05:20:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 611. [2021-01-07 05:20:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2021-01-07 05:20:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 799 transitions. [2021-01-07 05:20:48,049 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 799 transitions. Word has length 46 [2021-01-07 05:20:48,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:48,049 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 799 transitions. [2021-01-07 05:20:48,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-07 05:20:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 799 transitions. [2021-01-07 05:20:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 05:20:48,050 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:48,050 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:48,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:48,265 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:48,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1637319801, now seen corresponding path program 1 times [2021-01-07 05:20:48,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:48,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000619508] [2021-01-07 05:20:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:48,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000619508] [2021-01-07 05:20:48,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919700963] [2021-01-07 05:20:48,562 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:20:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:48,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-07 05:20:48,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:48,697 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:20:48,698 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:48,704 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:48,705 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:48,705 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-01-07 05:20:48,854 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-07 05:20:48,855 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:48,862 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:48,865 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:48,865 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2021-01-07 05:20:48,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:49,001 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:49,002 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2021-01-07 05:20:49,002 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:49,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:49,010 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:49,010 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:11 [2021-01-07 05:20:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:49,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:20:49,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2021-01-07 05:20:49,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384986853] [2021-01-07 05:20:49,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-07 05:20:49,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:49,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-07 05:20:49,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:20:49,037 INFO L87 Difference]: Start difference. First operand 611 states and 799 transitions. Second operand 13 states. [2021-01-07 05:20:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:50,060 INFO L93 Difference]: Finished difference Result 842 states and 1044 transitions. [2021-01-07 05:20:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 05:20:50,061 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2021-01-07 05:20:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:50,065 INFO L225 Difference]: With dead ends: 842 [2021-01-07 05:20:50,065 INFO L226 Difference]: Without dead ends: 842 [2021-01-07 05:20:50,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=830, Unknown=0, NotChecked=0, Total=1122 [2021-01-07 05:20:50,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2021-01-07 05:20:50,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 610. [2021-01-07 05:20:50,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2021-01-07 05:20:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 798 transitions. [2021-01-07 05:20:50,080 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 798 transitions. Word has length 46 [2021-01-07 05:20:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:50,081 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 798 transitions. [2021-01-07 05:20:50,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-07 05:20:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 798 transitions. [2021-01-07 05:20:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 05:20:50,082 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:50,082 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:50,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:50,297 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:50,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:50,298 INFO L82 PathProgramCache]: Analyzing trace with hash 725434154, now seen corresponding path program 1 times [2021-01-07 05:20:50,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:50,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530023361] [2021-01-07 05:20:50,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:50,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530023361] [2021-01-07 05:20:50,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786707552] [2021-01-07 05:20:50,341 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:20:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:50,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 05:20:50,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:50,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:20:50,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-01-07 05:20:50,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044637450] [2021-01-07 05:20:50,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:50,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:50,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:50,471 INFO L87 Difference]: Start difference. First operand 610 states and 798 transitions. Second operand 4 states. [2021-01-07 05:20:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:50,493 INFO L93 Difference]: Finished difference Result 921 states and 1194 transitions. [2021-01-07 05:20:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:50,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2021-01-07 05:20:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:50,498 INFO L225 Difference]: With dead ends: 921 [2021-01-07 05:20:50,499 INFO L226 Difference]: Without dead ends: 921 [2021-01-07 05:20:50,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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:20:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-01-07 05:20:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 822. [2021-01-07 05:20:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2021-01-07 05:20:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1100 transitions. [2021-01-07 05:20:50,516 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1100 transitions. Word has length 47 [2021-01-07 05:20:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:50,517 INFO L481 AbstractCegarLoop]: Abstraction has 822 states and 1100 transitions. [2021-01-07 05:20:50,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1100 transitions. [2021-01-07 05:20:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 05:20:50,518 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:50,518 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:50,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-01-07 05:20:50,732 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:50,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:50,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1896873646, now seen corresponding path program 1 times [2021-01-07 05:20:50,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:50,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598043835] [2021-01-07 05:20:50,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 05:20:50,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598043835] [2021-01-07 05:20:50,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:50,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:50,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237476177] [2021-01-07 05:20:50,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:20:50,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:50,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:20:50,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:20:50,901 INFO L87 Difference]: Start difference. First operand 822 states and 1100 transitions. Second operand 7 states. [2021-01-07 05:20:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:51,249 INFO L93 Difference]: Finished difference Result 1087 states and 1399 transitions. [2021-01-07 05:20:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:20:51,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2021-01-07 05:20:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:51,254 INFO L225 Difference]: With dead ends: 1087 [2021-01-07 05:20:51,254 INFO L226 Difference]: Without dead ends: 1087 [2021-01-07 05:20:51,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:20:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2021-01-07 05:20:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 819. [2021-01-07 05:20:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2021-01-07 05:20:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1086 transitions. [2021-01-07 05:20:51,268 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1086 transitions. Word has length 47 [2021-01-07 05:20:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:51,269 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 1086 transitions. [2021-01-07 05:20:51,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:20:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1086 transitions. [2021-01-07 05:20:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 05:20:51,269 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:51,270 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:51,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-07 05:20:51,270 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:51,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1541435306, now seen corresponding path program 1 times [2021-01-07 05:20:51,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:51,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663044276] [2021-01-07 05:20:51,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:51,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663044276] [2021-01-07 05:20:51,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996886735] [2021-01-07 05:20:51,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:52,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 56 conjunts are in the unsatisfiable core [2021-01-07 05:20:52,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:52,101 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:20:52,102 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:52,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:52,110 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:52,110 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-01-07 05:20:52,138 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:52,139 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:52,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:52,148 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:52,148 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-01-07 05:20:52,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:52,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:52,215 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-01-07 05:20:52,216 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:52,222 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:52,222 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:52,223 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2021-01-07 05:20:52,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:52,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:52,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:52,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:52,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:52,338 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:52,341 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:52,341 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2021-01-07 05:20:52,343 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:52,345 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:52,345 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:20:52,346 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:5 [2021-01-07 05:20:52,361 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:52,362 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:20:52,363 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:52,374 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2021-01-07 05:20:52,376 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:20:52,376 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2021-01-07 05:20:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:52,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:52,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2021-01-07 05:20:52,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149782067] [2021-01-07 05:20:52,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-07 05:20:52,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:52,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-07 05:20:52,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:20:52,420 INFO L87 Difference]: Start difference. First operand 819 states and 1086 transitions. Second operand 23 states. [2021-01-07 05:20:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:55,399 INFO L93 Difference]: Finished difference Result 1591 states and 2047 transitions. [2021-01-07 05:20:55,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-01-07 05:20:55,400 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2021-01-07 05:20:55,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:55,407 INFO L225 Difference]: With dead ends: 1591 [2021-01-07 05:20:55,407 INFO L226 Difference]: Without dead ends: 1591 [2021-01-07 05:20:55,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=702, Invalid=1950, Unknown=0, NotChecked=0, Total=2652 [2021-01-07 05:20:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2021-01-07 05:20:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 895. [2021-01-07 05:20:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2021-01-07 05:20:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1185 transitions. [2021-01-07 05:20:55,430 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1185 transitions. Word has length 47 [2021-01-07 05:20:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:55,430 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 1185 transitions. [2021-01-07 05:20:55,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-07 05:20:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1185 transitions. [2021-01-07 05:20:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 05:20:55,431 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:55,431 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:55,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:55,646 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:55,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1541435305, now seen corresponding path program 1 times [2021-01-07 05:20:55,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:55,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485313268] [2021-01-07 05:20:55,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:56,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485313268] [2021-01-07 05:20:56,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24520794] [2021-01-07 05:20:56,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:56,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 76 conjunts are in the unsatisfiable core [2021-01-07 05:20:56,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:56,630 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:20:56,631 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:56,639 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:56,640 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:56,640 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-01-07 05:20:56,792 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:56,792 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:56,805 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:56,809 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:56,810 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:56,821 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:56,822 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:56,823 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2021-01-07 05:20:56,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:56,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:56,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-01-07 05:20:56,938 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:56,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:56,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:56,956 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 20 [2021-01-07 05:20:56,957 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:56,967 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:56,969 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:56,969 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:48 [2021-01-07 05:20:57,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:57,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:57,127 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 12 [2021-01-07 05:20:57,129 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:57,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:57,158 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:57,159 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 13 [2021-01-07 05:20:57,160 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:57,164 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:20:57,164 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:9 [2021-01-07 05:20:57,200 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:57,201 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:20:57,205 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,219 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2021-01-07 05:20:57,220 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:20:57,221 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2021-01-07 05:20:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:57,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:57,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2021-01-07 05:20:57,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136203335] [2021-01-07 05:20:57,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-07 05:20:57,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:57,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-07 05:20:57,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2021-01-07 05:20:57,286 INFO L87 Difference]: Start difference. First operand 895 states and 1185 transitions. Second operand 28 states. [2021-01-07 05:20:58,078 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2021-01-07 05:20:58,388 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 72 [2021-01-07 05:20:58,620 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2021-01-07 05:20:58,830 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2021-01-07 05:20:59,054 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-01-07 05:20:59,242 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 65 [2021-01-07 05:20:59,475 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2021-01-07 05:20:59,960 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-01-07 05:21:00,131 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-01-07 05:21:00,368 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 71 [2021-01-07 05:21:00,551 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2021-01-07 05:21:00,883 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 81 [2021-01-07 05:21:01,237 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2021-01-07 05:21:01,507 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 79 [2021-01-07 05:21:01,740 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2021-01-07 05:21:02,000 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2021-01-07 05:21:02,225 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 76 [2021-01-07 05:21:02,417 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2021-01-07 05:21:02,694 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2021-01-07 05:21:02,935 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-01-07 05:21:03,217 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2021-01-07 05:21:03,504 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2021-01-07 05:21:03,682 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2021-01-07 05:21:03,919 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2021-01-07 05:21:04,086 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2021-01-07 05:21:04,276 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2021-01-07 05:21:04,547 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2021-01-07 05:21:04,769 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2021-01-07 05:21:04,991 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2021-01-07 05:21:05,254 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2021-01-07 05:21:05,402 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2021-01-07 05:21:06,353 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-01-07 05:21:06,949 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2021-01-07 05:21:07,407 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2021-01-07 05:21:07,623 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2021-01-07 05:21:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:07,683 INFO L93 Difference]: Finished difference Result 2108 states and 2670 transitions. [2021-01-07 05:21:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-01-07 05:21:07,684 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2021-01-07 05:21:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:07,692 INFO L225 Difference]: With dead ends: 2108 [2021-01-07 05:21:07,692 INFO L226 Difference]: Without dead ends: 2108 [2021-01-07 05:21:07,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1612 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1342, Invalid=4978, Unknown=0, NotChecked=0, Total=6320 [2021-01-07 05:21:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2021-01-07 05:21:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 909. [2021-01-07 05:21:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2021-01-07 05:21:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1198 transitions. [2021-01-07 05:21:07,723 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1198 transitions. Word has length 47 [2021-01-07 05:21:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:07,723 INFO L481 AbstractCegarLoop]: Abstraction has 909 states and 1198 transitions. [2021-01-07 05:21:07,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-07 05:21:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1198 transitions. [2021-01-07 05:21:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-07 05:21:07,724 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:07,724 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:07,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:07,938 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:07,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1025843673, now seen corresponding path program 1 times [2021-01-07 05:21:07,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:07,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183016492] [2021-01-07 05:21:07,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:08,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183016492] [2021-01-07 05:21:08,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637873853] [2021-01-07 05:21:08,027 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:08,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:21:08,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:08,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:21:08,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-01-07 05:21:08,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502995082] [2021-01-07 05:21:08,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:21:08,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:08,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:21:08,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:21:08,208 INFO L87 Difference]: Start difference. First operand 909 states and 1198 transitions. Second operand 10 states. [2021-01-07 05:21:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:08,242 INFO L93 Difference]: Finished difference Result 1238 states and 1630 transitions. [2021-01-07 05:21:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:21:08,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2021-01-07 05:21:08,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:08,254 INFO L225 Difference]: With dead ends: 1238 [2021-01-07 05:21:08,254 INFO L226 Difference]: Without dead ends: 1238 [2021-01-07 05:21:08,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:21:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2021-01-07 05:21:08,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 913. [2021-01-07 05:21:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2021-01-07 05:21:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1202 transitions. [2021-01-07 05:21:08,283 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1202 transitions. Word has length 48 [2021-01-07 05:21:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:08,283 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1202 transitions. [2021-01-07 05:21:08,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:21:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1202 transitions. [2021-01-07 05:21:08,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-07 05:21:08,284 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:08,285 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:08,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-01-07 05:21:08,498 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:08,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:08,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1584252865, now seen corresponding path program 2 times [2021-01-07 05:21:08,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:08,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186725611] [2021-01-07 05:21:08,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:08,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186725611] [2021-01-07 05:21:08,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455215040] [2021-01-07 05:21:08,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:08,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:21:08,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:21:08,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 05:21:08,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:08,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:21:08,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-01-07 05:21:08,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601675304] [2021-01-07 05:21:08,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 05:21:08,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 05:21:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:21:08,772 INFO L87 Difference]: Start difference. First operand 913 states and 1202 transitions. Second operand 12 states. [2021-01-07 05:21:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:08,813 INFO L93 Difference]: Finished difference Result 1242 states and 1634 transitions. [2021-01-07 05:21:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:21:08,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2021-01-07 05:21:08,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:08,824 INFO L225 Difference]: With dead ends: 1242 [2021-01-07 05:21:08,824 INFO L226 Difference]: Without dead ends: 1242 [2021-01-07 05:21:08,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:21:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2021-01-07 05:21:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 917. [2021-01-07 05:21:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2021-01-07 05:21:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1206 transitions. [2021-01-07 05:21:08,842 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1206 transitions. Word has length 49 [2021-01-07 05:21:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:08,842 INFO L481 AbstractCegarLoop]: Abstraction has 917 states and 1206 transitions. [2021-01-07 05:21:08,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 05:21:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1206 transitions. [2021-01-07 05:21:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-07 05:21:08,844 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:08,844 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:09,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-01-07 05:21:09,060 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:09,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:09,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1358977070, now seen corresponding path program 1 times [2021-01-07 05:21:09,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:09,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752018398] [2021-01-07 05:21:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:10,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752018398] [2021-01-07 05:21:10,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331201939] [2021-01-07 05:21:10,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:10,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-07 05:21:10,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:10,259 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:21:10,260 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:10,268 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:10,269 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:10,269 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-01-07 05:21:10,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:10,354 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 24 [2021-01-07 05:21:10,355 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:10,362 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:10,363 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:10,364 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:32 [2021-01-07 05:21:10,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:10,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:10,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:21:10,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:10,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:10,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:21:10,465 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:10,466 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 15 [2021-01-07 05:21:10,467 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:10,469 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:10,470 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:21:10,470 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:5 [2021-01-07 05:21:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:10,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:21:10,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 21 [2021-01-07 05:21:10,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604269535] [2021-01-07 05:21:10,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 05:21:10,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:10,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 05:21:10,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:21:10,491 INFO L87 Difference]: Start difference. First operand 917 states and 1206 transitions. Second operand 14 states. [2021-01-07 05:21:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:12,040 INFO L93 Difference]: Finished difference Result 1194 states and 1510 transitions. [2021-01-07 05:21:12,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-07 05:21:12,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2021-01-07 05:21:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:12,044 INFO L225 Difference]: With dead ends: 1194 [2021-01-07 05:21:12,044 INFO L226 Difference]: Without dead ends: 1194 [2021-01-07 05:21:12,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=476, Invalid=1330, Unknown=0, NotChecked=0, Total=1806 [2021-01-07 05:21:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2021-01-07 05:21:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 933. [2021-01-07 05:21:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2021-01-07 05:21:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1228 transitions. [2021-01-07 05:21:12,061 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1228 transitions. Word has length 49 [2021-01-07 05:21:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:12,061 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1228 transitions. [2021-01-07 05:21:12,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 05:21:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1228 transitions. [2021-01-07 05:21:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-07 05:21:12,062 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:12,062 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:12,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-01-07 05:21:12,276 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash 549630444, now seen corresponding path program 1 times [2021-01-07 05:21:12,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:12,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148747605] [2021-01-07 05:21:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:12,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148747605] [2021-01-07 05:21:12,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930044520] [2021-01-07 05:21:12,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:12,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 05:21:12,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:12,893 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-07 05:21:12,894 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:12,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:12,905 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:21:12,905 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2021-01-07 05:21:13,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:21:13,054 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:13,054 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-01-07 05:21:13,055 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:13,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:13,065 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:13,065 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:9 [2021-01-07 05:21:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:13,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:21:13,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2021-01-07 05:21:13,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300164740] [2021-01-07 05:21:13,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-07 05:21:13,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:13,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-07 05:21:13,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:21:13,097 INFO L87 Difference]: Start difference. First operand 933 states and 1228 transitions. Second operand 13 states. [2021-01-07 05:21:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:13,966 INFO L93 Difference]: Finished difference Result 1100 states and 1397 transitions. [2021-01-07 05:21:13,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 05:21:13,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2021-01-07 05:21:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:13,969 INFO L225 Difference]: With dead ends: 1100 [2021-01-07 05:21:13,969 INFO L226 Difference]: Without dead ends: 1100 [2021-01-07 05:21:13,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=824, Unknown=0, NotChecked=0, Total=1122 [2021-01-07 05:21:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2021-01-07 05:21:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 918. [2021-01-07 05:21:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2021-01-07 05:21:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1207 transitions. [2021-01-07 05:21:13,983 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1207 transitions. Word has length 49 [2021-01-07 05:21:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:13,983 INFO L481 AbstractCegarLoop]: Abstraction has 918 states and 1207 transitions. [2021-01-07 05:21:13,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-07 05:21:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1207 transitions. [2021-01-07 05:21:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-07 05:21:13,984 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:13,985 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:14,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:14,199 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:14,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:14,200 INFO L82 PathProgramCache]: Analyzing trace with hash 892866919, now seen corresponding path program 3 times [2021-01-07 05:21:14,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:14,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316034210] [2021-01-07 05:21:14,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:14,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316034210] [2021-01-07 05:21:14,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015535006] [2021-01-07 05:21:14,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:14,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 05:21:14,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:21:14,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjunts are in the unsatisfiable core [2021-01-07 05:21:14,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:14,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:14,398 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-01-07 05:21:14,400 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:14,417 INFO L625 ElimStorePlain]: treesize reduction 4, result has 84.6 percent of original size [2021-01-07 05:21:14,419 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:14,419 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:14 [2021-01-07 05:21:14,638 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 7 treesize of output 3 [2021-01-07 05:21:14,639 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:14,645 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:14,647 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 20 treesize of output 8 [2021-01-07 05:21:14,649 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:14,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:14,655 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:21:14,655 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:4 [2021-01-07 05:21:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-07 05:21:14,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:21:14,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2021-01-07 05:21:14,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733593497] [2021-01-07 05:21:14,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:21:14,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:14,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:21:14,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:21:14,698 INFO L87 Difference]: Start difference. First operand 918 states and 1207 transitions. Second operand 10 states. [2021-01-07 05:21:15,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:15,348 INFO L93 Difference]: Finished difference Result 783 states and 1015 transitions. [2021-01-07 05:21:15,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:21:15,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2021-01-07 05:21:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:15,350 INFO L225 Difference]: With dead ends: 783 [2021-01-07 05:21:15,350 INFO L226 Difference]: Without dead ends: 778 [2021-01-07 05:21:15,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:21:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2021-01-07 05:21:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 757. [2021-01-07 05:21:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2021-01-07 05:21:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 984 transitions. [2021-01-07 05:21:15,359 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 984 transitions. Word has length 50 [2021-01-07 05:21:15,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:15,360 INFO L481 AbstractCegarLoop]: Abstraction has 757 states and 984 transitions. [2021-01-07 05:21:15,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:21:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 984 transitions. [2021-01-07 05:21:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 05:21:15,360 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:15,361 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:15,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:15,567 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:15,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:15,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1447053352, now seen corresponding path program 1 times [2021-01-07 05:21:15,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:15,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901202093] [2021-01-07 05:21:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:15,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901202093] [2021-01-07 05:21:15,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:21:15,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-07 05:21:15,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035291388] [2021-01-07 05:21:15,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 05:21:15,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:15,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 05:21:15,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:21:15,921 INFO L87 Difference]: Start difference. First operand 757 states and 984 transitions. Second operand 14 states. [2021-01-07 05:21:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:16,741 INFO L93 Difference]: Finished difference Result 944 states and 1193 transitions. [2021-01-07 05:21:16,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:21:16,742 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2021-01-07 05:21:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:16,744 INFO L225 Difference]: With dead ends: 944 [2021-01-07 05:21:16,744 INFO L226 Difference]: Without dead ends: 944 [2021-01-07 05:21:16,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:21:16,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2021-01-07 05:21:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 779. [2021-01-07 05:21:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2021-01-07 05:21:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1012 transitions. [2021-01-07 05:21:16,754 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1012 transitions. Word has length 51 [2021-01-07 05:21:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:16,755 INFO L481 AbstractCegarLoop]: Abstraction has 779 states and 1012 transitions. [2021-01-07 05:21:16,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 05:21:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1012 transitions. [2021-01-07 05:21:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 05:21:16,755 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:16,756 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:16,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-01-07 05:21:16,756 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:16,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:16,756 INFO L82 PathProgramCache]: Analyzing trace with hash 924466795, now seen corresponding path program 1 times [2021-01-07 05:21:16,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:16,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960968468] [2021-01-07 05:21:16,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:16,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960968468] [2021-01-07 05:21:16,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319294630] [2021-01-07 05:21:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:16,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 05:21:16,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:16,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:21:16,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-01-07 05:21:16,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261460920] [2021-01-07 05:21:16,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:21:16,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:16,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:21:16,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:21:16,933 INFO L87 Difference]: Start difference. First operand 779 states and 1012 transitions. Second operand 5 states. [2021-01-07 05:21:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:16,969 INFO L93 Difference]: Finished difference Result 2006 states and 2557 transitions. [2021-01-07 05:21:16,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:21:16,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2021-01-07 05:21:16,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:16,974 INFO L225 Difference]: With dead ends: 2006 [2021-01-07 05:21:16,974 INFO L226 Difference]: Without dead ends: 2006 [2021-01-07 05:21:16,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:21:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2021-01-07 05:21:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1420. [2021-01-07 05:21:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2021-01-07 05:21:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1876 transitions. [2021-01-07 05:21:17,012 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1876 transitions. Word has length 52 [2021-01-07 05:21:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:17,013 INFO L481 AbstractCegarLoop]: Abstraction has 1420 states and 1876 transitions. [2021-01-07 05:21:17,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:21:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1876 transitions. [2021-01-07 05:21:17,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 05:21:17,014 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:17,015 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:17,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:17,230 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:17,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:17,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1908980738, now seen corresponding path program 1 times [2021-01-07 05:21:17,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:17,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287938313] [2021-01-07 05:21:17,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:17,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287938313] [2021-01-07 05:21:17,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:21:17,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-07 05:21:17,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284907714] [2021-01-07 05:21:17,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 05:21:17,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:17,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 05:21:17,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:21:17,663 INFO L87 Difference]: Start difference. First operand 1420 states and 1876 transitions. Second operand 14 states. [2021-01-07 05:21:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:18,698 INFO L93 Difference]: Finished difference Result 1653 states and 2145 transitions. [2021-01-07 05:21:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:21:18,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2021-01-07 05:21:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:18,702 INFO L225 Difference]: With dead ends: 1653 [2021-01-07 05:21:18,702 INFO L226 Difference]: Without dead ends: 1653 [2021-01-07 05:21:18,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:21:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2021-01-07 05:21:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1428. [2021-01-07 05:21:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2021-01-07 05:21:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1884 transitions. [2021-01-07 05:21:18,726 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1884 transitions. Word has length 52 [2021-01-07 05:21:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:18,726 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1884 transitions. [2021-01-07 05:21:18,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 05:21:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1884 transitions. [2021-01-07 05:21:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 05:21:18,727 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:18,727 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:18,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-01-07 05:21:18,728 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:18,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:18,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1406301723, now seen corresponding path program 1 times [2021-01-07 05:21:18,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:18,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450901723] [2021-01-07 05:21:18,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:19,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450901723] [2021-01-07 05:21:19,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187184080] [2021-01-07 05:21:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:19,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 42 conjunts are in the unsatisfiable core [2021-01-07 05:21:19,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:19,500 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2021-01-07 05:21:19,500 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 3 case distinctions, treesize of input 15 treesize of output 41 [2021-01-07 05:21:19,505 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:19,540 INFO L625 ElimStorePlain]: treesize reduction 10, result has 77.3 percent of original size [2021-01-07 05:21:19,543 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 05:21:19,546 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 05:21:19,547 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-07 05:21:19,548 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:21:19,548 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:34 [2021-01-07 05:21:19,550 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 05:21:19,551 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 05:21:19,552 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-07 05:21:19,600 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 05:21:19,602 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 05:21:19,604 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-07 05:21:19,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:20,227 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-07 05:21:20,229 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:20,235 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-07 05:21:20,236 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:20,285 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:20,286 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:21:20,287 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:85 [2021-01-07 05:21:20,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 1] term [2021-01-07 05:21:20,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:20,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:20,514 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 51 treesize of output 34 [2021-01-07 05:21:20,516 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:20,558 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:20,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:20,564 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2021-01-07 05:21:20,566 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:20,606 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:20,607 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:21:20,607 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:121 [2021-01-07 05:21:20,845 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2021-01-07 05:21:20,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:20,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:20,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:20,859 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 18 [2021-01-07 05:21:20,860 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:20,883 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:20,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:20,889 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 18 [2021-01-07 05:21:20,890 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:20,910 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:20,912 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-01-07 05:21:20,913 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:45 [2021-01-07 05:21:21,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:21,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:21:21,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 29 [2021-01-07 05:21:21,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317321845] [2021-01-07 05:21:21,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-01-07 05:21:21,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:21,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-01-07 05:21:21,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:21:21,260 INFO L87 Difference]: Start difference. First operand 1428 states and 1884 transitions. Second operand 31 states. [2021-01-07 05:21:21,699 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2021-01-07 05:21:21,890 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2021-01-07 05:21:22,120 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2021-01-07 05:21:22,439 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2021-01-07 05:21:22,901 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2021-01-07 05:21:23,156 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2021-01-07 05:21:23,450 WARN L197 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2021-01-07 05:21:23,746 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2021-01-07 05:21:24,033 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2021-01-07 05:21:24,335 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 62 [2021-01-07 05:21:24,639 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2021-01-07 05:21:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:25,140 INFO L93 Difference]: Finished difference Result 1748 states and 2281 transitions. [2021-01-07 05:21:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:21:25,141 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2021-01-07 05:21:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:25,145 INFO L225 Difference]: With dead ends: 1748 [2021-01-07 05:21:25,145 INFO L226 Difference]: Without dead ends: 1727 [2021-01-07 05:21:25,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=398, Invalid=1582, Unknown=0, NotChecked=0, Total=1980 [2021-01-07 05:21:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2021-01-07 05:21:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1440. [2021-01-07 05:21:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2021-01-07 05:21:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1901 transitions. [2021-01-07 05:21:25,166 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1901 transitions. Word has length 53 [2021-01-07 05:21:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:25,167 INFO L481 AbstractCegarLoop]: Abstraction has 1440 states and 1901 transitions. [2021-01-07 05:21:25,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2021-01-07 05:21:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1901 transitions. [2021-01-07 05:21:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 05:21:25,167 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:25,168 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:25,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-01-07 05:21:25,382 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:25,383 INFO L82 PathProgramCache]: Analyzing trace with hash 951139482, now seen corresponding path program 1 times [2021-01-07 05:21:25,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:25,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820804751] [2021-01-07 05:21:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:25,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820804751] [2021-01-07 05:21:25,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:21:25,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-07 05:21:25,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870813865] [2021-01-07 05:21:25,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 05:21:25,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 05:21:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:21:25,744 INFO L87 Difference]: Start difference. First operand 1440 states and 1901 transitions. Second operand 14 states. [2021-01-07 05:21:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:26,670 INFO L93 Difference]: Finished difference Result 1759 states and 2286 transitions. [2021-01-07 05:21:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 05:21:26,670 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2021-01-07 05:21:26,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:26,673 INFO L225 Difference]: With dead ends: 1759 [2021-01-07 05:21:26,673 INFO L226 Difference]: Without dead ends: 1759 [2021-01-07 05:21:26,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:21:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2021-01-07 05:21:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1470. [2021-01-07 05:21:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1470 states. [2021-01-07 05:21:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1935 transitions. [2021-01-07 05:21:26,695 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1935 transitions. Word has length 53 [2021-01-07 05:21:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:26,696 INFO L481 AbstractCegarLoop]: Abstraction has 1470 states and 1935 transitions. [2021-01-07 05:21:26,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 05:21:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1935 transitions. [2021-01-07 05:21:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-07 05:21:26,697 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:26,697 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:26,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-01-07 05:21:26,697 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:26,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:26,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1792374338, now seen corresponding path program 1 times [2021-01-07 05:21:26,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:26,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032894481] [2021-01-07 05:21:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:21:28,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032894481] [2021-01-07 05:21:28,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299874026] [2021-01-07 05:21:28,142 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:28,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 49 conjunts are in the unsatisfiable core [2021-01-07 05:21:28,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:28,664 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 15 treesize of output 11 [2021-01-07 05:21:28,665 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,675 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,676 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,676 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2021-01-07 05:21:28,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:28,755 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 36 treesize of output 27 [2021-01-07 05:21:28,756 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,767 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:21:28,768 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2021-01-07 05:21:29,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:29,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:29,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:29,152 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:29,153 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 27 [2021-01-07 05:21:29,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:29,156 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:21:29,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:29,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:29,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:29,182 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:29,183 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 62 [2021-01-07 05:21:29,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:21:29,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:29,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:29,190 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:29,217 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:29,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:29,222 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:21:29,223 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:144, output treesize:161 [2021-01-07 05:21:29,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:29,447 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 2, 1] term [2021-01-07 05:21:29,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:29,448 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-01-07 05:21:29,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:29,450 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-01-07 05:21:29,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:21:29,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:21:29,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2021-01-07 05:21:29,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872150111] [2021-01-07 05:21:29,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-01-07 05:21:29,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:29,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-01-07 05:21:29,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1431, Unknown=0, NotChecked=0, Total=1560 [2021-01-07 05:21:29,522 INFO L87 Difference]: Start difference. First operand 1470 states and 1935 transitions. Second operand 40 states. [2021-01-07 05:21:30,659 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2021-01-07 05:21:30,858 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2021-01-07 05:21:31,559 WARN L197 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2021-01-07 05:21:32,074 WARN L197 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2021-01-07 05:21:33,037 WARN L197 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 [2021-01-07 05:21:33,703 WARN L197 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2021-01-07 05:21:34,431 WARN L197 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2021-01-07 05:21:35,316 WARN L197 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 91 [2021-01-07 05:21:36,255 WARN L197 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 92 [2021-01-07 05:21:37,206 WARN L197 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 89 [2021-01-07 05:21:38,037 WARN L197 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 90 [2021-01-07 05:21:38,402 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2021-01-07 05:21:38,562 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2021-01-07 05:21:38,889 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2021-01-07 05:21:39,219 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2021-01-07 05:21:39,437 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2021-01-07 05:21:39,684 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2021-01-07 05:21:39,887 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2021-01-07 05:21:40,099 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2021-01-07 05:21:40,298 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2021-01-07 05:21:40,620 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2021-01-07 05:21:40,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:40,702 INFO L93 Difference]: Finished difference Result 3128 states and 4129 transitions. [2021-01-07 05:21:40,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-01-07 05:21:40,703 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 55 [2021-01-07 05:21:40,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:40,708 INFO L225 Difference]: With dead ends: 3128 [2021-01-07 05:21:40,709 INFO L226 Difference]: Without dead ends: 3124 [2021-01-07 05:21:40,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1125, Invalid=4277, Unknown=0, NotChecked=0, Total=5402 [2021-01-07 05:21:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2021-01-07 05:21:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 1546. [2021-01-07 05:21:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2021-01-07 05:21:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2037 transitions. [2021-01-07 05:21:40,737 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2037 transitions. Word has length 55 [2021-01-07 05:21:40,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:40,738 INFO L481 AbstractCegarLoop]: Abstraction has 1546 states and 2037 transitions. [2021-01-07 05:21:40,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2021-01-07 05:21:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2037 transitions. [2021-01-07 05:21:40,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-07 05:21:40,739 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:40,739 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:40,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-01-07 05:21:40,953 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:40,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:40,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1174589174, now seen corresponding path program 2 times [2021-01-07 05:21:40,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:40,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455108828] [2021-01-07 05:21:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:41,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455108828] [2021-01-07 05:21:41,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:21:41,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-07 05:21:41,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345662256] [2021-01-07 05:21:41,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-07 05:21:41,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:41,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-07 05:21:41,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:21:41,940 INFO L87 Difference]: Start difference. First operand 1546 states and 2037 transitions. Second operand 20 states. [2021-01-07 05:21:43,778 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2021-01-07 05:21:44,031 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2021-01-07 05:21:44,374 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2021-01-07 05:21:44,548 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2021-01-07 05:21:44,747 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2021-01-07 05:21:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:45,188 INFO L93 Difference]: Finished difference Result 2039 states and 2636 transitions. [2021-01-07 05:21:45,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-07 05:21:45,189 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2021-01-07 05:21:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:45,193 INFO L225 Difference]: With dead ends: 2039 [2021-01-07 05:21:45,194 INFO L226 Difference]: Without dead ends: 2035 [2021-01-07 05:21:45,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=555, Invalid=1425, Unknown=0, NotChecked=0, Total=1980 [2021-01-07 05:21:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2021-01-07 05:21:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1210. [2021-01-07 05:21:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2021-01-07 05:21:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1585 transitions. [2021-01-07 05:21:45,216 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1585 transitions. Word has length 55 [2021-01-07 05:21:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:45,216 INFO L481 AbstractCegarLoop]: Abstraction has 1210 states and 1585 transitions. [2021-01-07 05:21:45,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-07 05:21:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1585 transitions. [2021-01-07 05:21:45,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-07 05:21:45,217 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:45,217 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:45,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-01-07 05:21:45,217 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:45,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:45,218 INFO L82 PathProgramCache]: Analyzing trace with hash -782984868, now seen corresponding path program 1 times [2021-01-07 05:21:45,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:45,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799287063] [2021-01-07 05:21:45,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 05:21:45,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799287063] [2021-01-07 05:21:45,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:21:45,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:21:45,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618547031] [2021-01-07 05:21:45,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:21:45,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:45,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:21:45,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:21:45,370 INFO L87 Difference]: Start difference. First operand 1210 states and 1585 transitions. Second operand 8 states. [2021-01-07 05:21:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:45,796 INFO L93 Difference]: Finished difference Result 1479 states and 1919 transitions. [2021-01-07 05:21:45,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:21:45,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2021-01-07 05:21:45,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:45,801 INFO L225 Difference]: With dead ends: 1479 [2021-01-07 05:21:45,802 INFO L226 Difference]: Without dead ends: 1479 [2021-01-07 05:21:45,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:21:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2021-01-07 05:21:45,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1209. [2021-01-07 05:21:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2021-01-07 05:21:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1581 transitions. [2021-01-07 05:21:45,819 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1581 transitions. Word has length 55 [2021-01-07 05:21:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:45,820 INFO L481 AbstractCegarLoop]: Abstraction has 1209 states and 1581 transitions. [2021-01-07 05:21:45,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:21:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1581 transitions. [2021-01-07 05:21:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 05:21:45,820 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:45,821 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:45,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-01-07 05:21:45,821 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:45,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:45,822 INFO L82 PathProgramCache]: Analyzing trace with hash 87441735, now seen corresponding path program 1 times [2021-01-07 05:21:45,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:45,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955432930] [2021-01-07 05:21:45,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:46,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955432930] [2021-01-07 05:21:46,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:21:46,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-01-07 05:21:46,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175449410] [2021-01-07 05:21:46,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-07 05:21:46,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:46,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-07 05:21:46,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:21:46,895 INFO L87 Difference]: Start difference. First operand 1209 states and 1581 transitions. Second operand 18 states. [2021-01-07 05:21:47,904 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2021-01-07 05:21:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:48,512 INFO L93 Difference]: Finished difference Result 1517 states and 1932 transitions. [2021-01-07 05:21:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-07 05:21:48,513 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2021-01-07 05:21:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:48,515 INFO L225 Difference]: With dead ends: 1517 [2021-01-07 05:21:48,515 INFO L226 Difference]: Without dead ends: 1517 [2021-01-07 05:21:48,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2021-01-07 05:21:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2021-01-07 05:21:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1209. [2021-01-07 05:21:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2021-01-07 05:21:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1573 transitions. [2021-01-07 05:21:48,532 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1573 transitions. Word has length 56 [2021-01-07 05:21:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:48,532 INFO L481 AbstractCegarLoop]: Abstraction has 1209 states and 1573 transitions. [2021-01-07 05:21:48,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-07 05:21:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1573 transitions. [2021-01-07 05:21:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-07 05:21:48,533 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:48,533 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:48,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-01-07 05:21:48,533 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:48,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1988269654, now seen corresponding path program 1 times [2021-01-07 05:21:48,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:48,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616101252] [2021-01-07 05:21:48,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:49,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616101252] [2021-01-07 05:21:49,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:21:49,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-07 05:21:49,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273207169] [2021-01-07 05:21:49,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-07 05:21:49,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:49,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-07 05:21:49,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:21:49,353 INFO L87 Difference]: Start difference. First operand 1209 states and 1573 transitions. Second operand 17 states. [2021-01-07 05:21:50,531 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2021-01-07 05:21:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:51,528 INFO L93 Difference]: Finished difference Result 1324 states and 1693 transitions. [2021-01-07 05:21:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-07 05:21:51,529 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2021-01-07 05:21:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:51,530 INFO L225 Difference]: With dead ends: 1324 [2021-01-07 05:21:51,530 INFO L226 Difference]: Without dead ends: 1324 [2021-01-07 05:21:51,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=504, Invalid=1218, Unknown=0, NotChecked=0, Total=1722 [2021-01-07 05:21:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2021-01-07 05:21:51,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1015. [2021-01-07 05:21:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2021-01-07 05:21:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1322 transitions. [2021-01-07 05:21:51,541 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1322 transitions. Word has length 62 [2021-01-07 05:21:51,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:51,541 INFO L481 AbstractCegarLoop]: Abstraction has 1015 states and 1322 transitions. [2021-01-07 05:21:51,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-07 05:21:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1322 transitions. [2021-01-07 05:21:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-07 05:21:51,542 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:51,542 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:51,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-01-07 05:21:51,543 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:51,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:51,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1038507967, now seen corresponding path program 1 times [2021-01-07 05:21:51,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:51,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931667760] [2021-01-07 05:21:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:52,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931667760] [2021-01-07 05:21:52,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047679158] [2021-01-07 05:21:52,351 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:52,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 59 conjunts are in the unsatisfiable core [2021-01-07 05:21:52,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:52,575 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 15 treesize of output 11 [2021-01-07 05:21:52,575 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:52,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:52,587 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:52,587 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2021-01-07 05:21:52,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:52,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:52,730 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:52,730 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 28 [2021-01-07 05:21:52,731 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:52,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:52,738 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:52,738 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2021-01-07 05:21:52,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:21:52,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:52,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:21:52,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:52,869 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:52,869 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 14 [2021-01-07 05:21:52,873 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:52,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:52,877 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:21:52,877 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:4 [2021-01-07 05:21:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:52,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:21:52,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2021-01-07 05:21:52,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686518672] [2021-01-07 05:21:52,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-07 05:21:52,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:52,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-07 05:21:52,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2021-01-07 05:21:52,961 INFO L87 Difference]: Start difference. First operand 1015 states and 1322 transitions. Second operand 28 states. [2021-01-07 05:21:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:56,518 INFO L93 Difference]: Finished difference Result 2107 states and 2713 transitions. [2021-01-07 05:21:56,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-01-07 05:21:56,519 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2021-01-07 05:21:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:56,521 INFO L225 Difference]: With dead ends: 2107 [2021-01-07 05:21:56,522 INFO L226 Difference]: Without dead ends: 2107 [2021-01-07 05:21:56,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=946, Invalid=2836, Unknown=0, NotChecked=0, Total=3782 [2021-01-07 05:21:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2021-01-07 05:21:56,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1101. [2021-01-07 05:21:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2021-01-07 05:21:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1427 transitions. [2021-01-07 05:21:56,555 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1427 transitions. Word has length 69 [2021-01-07 05:21:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:56,555 INFO L481 AbstractCegarLoop]: Abstraction has 1101 states and 1427 transitions. [2021-01-07 05:21:56,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-07 05:21:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1427 transitions. [2021-01-07 05:21:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-07 05:21:56,556 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:56,556 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:56,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:56,772 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:56,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1246261653, now seen corresponding path program 1 times [2021-01-07 05:21:56,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:56,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927924969] [2021-01-07 05:21:56,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:59,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927924969] [2021-01-07 05:21:59,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493533525] [2021-01-07 05:21:59,034 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:59,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 90 conjunts are in the unsatisfiable core [2021-01-07 05:21:59,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:59,696 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-07 05:21:59,697 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:59,715 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:59,716 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:59,716 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2021-01-07 05:21:59,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:59,901 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 47 treesize of output 30 [2021-01-07 05:21:59,902 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:59,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:59,916 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:59,917 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2021-01-07 05:22:00,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:00,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:00,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:00,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:00,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:00,435 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2021-01-07 05:22:00,436 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:00,464 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,466 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:22:00,466 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:80 [2021-01-07 05:22:00,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:00,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:00,628 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,629 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 97 [2021-01-07 05:22:00,631 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:00,707 INFO L625 ElimStorePlain]: treesize reduction 20, result has 80.2 percent of original size [2021-01-07 05:22:00,710 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:22:00,710 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:95, output treesize:62 [2021-01-07 05:22:00,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:00,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:00,860 INFO L348 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2021-01-07 05:22:00,861 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2021-01-07 05:22:00,865 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:00,898 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,900 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:22:00,900 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:81, output treesize:68 [2021-01-07 05:22:01,718 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 11, 1] term [2021-01-07 05:22:01,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:22:01,727 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_58|], 12=[v_prenex_7]} [2021-01-07 05:22:01,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:01,777 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:01,778 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 72 treesize of output 119 [2021-01-07 05:22:01,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:22:01,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:22:01,785 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:22:01,961 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2021-01-07 05:22:01,962 INFO L625 ElimStorePlain]: treesize reduction 84, result has 69.1 percent of original size [2021-01-07 05:22:01,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:01,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:02,050 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:02,051 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 85 treesize of output 187 [2021-01-07 05:22:02,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 05:22:02,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:02,061 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-01-07 05:22:02,289 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2021-01-07 05:22:02,290 INFO L625 ElimStorePlain]: treesize reduction 157, result has 55.0 percent of original size [2021-01-07 05:22:02,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:22:02,295 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-01-07 05:22:02,295 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:200, output treesize:188 [2021-01-07 05:22:02,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:22:21,498 WARN L197 SmtUtils]: Spent 19.03 s on a formula simplification that was a NOOP. DAG size: 58 [2021-01-07 05:22:21,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:46,983 WARN L197 SmtUtils]: Spent 1.42 m on a formula simplification. DAG size of input: 58 DAG size of output: 58