/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/forester-heap/dll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:13:16,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:13:16,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:13:16,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:13:16,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:13:16,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:13:16,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:13:16,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:13:16,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:13:16,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:13:16,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:13:16,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:13:16,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:13:16,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:13:16,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:13:16,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:13:16,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:13:16,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:13:16,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:13:16,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:13:16,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:13:16,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:13:16,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:13:16,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:13:16,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:13:16,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:13:16,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:13:16,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:13:16,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:13:16,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:13:16,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:13:16,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:13:16,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:13:16,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:13:16,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:13:16,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:13:16,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:13:16,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:13:16,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:13:16,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:13:16,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:13:16,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 16:13:16,712 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:13:16,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:13:16,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:13:16,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:13:16,718 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:13:16,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:13:16,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:13:16,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:13:16,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:13:16,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:13:16,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:13:16,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:13:16,721 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:13:16,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:13:16,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:13:16,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:13:16,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:13:16,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:13:16,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:13:16,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:13:16,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:13:16,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:13:16,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:13:16,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:13:16,724 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:13:16,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 16:13:17,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:13:17,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:13:17,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:13:17,203 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:13:17,203 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:13:17,205 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-1.i [2021-01-06 16:13:17,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1fb99ce68/9f5733ac459a4305ad88756a650d72fd/FLAG098140993 [2021-01-06 16:13:18,140 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:13:18,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i [2021-01-06 16:13:18,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1fb99ce68/9f5733ac459a4305ad88756a650d72fd/FLAG098140993 [2021-01-06 16:13:18,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1fb99ce68/9f5733ac459a4305ad88756a650d72fd [2021-01-06 16:13:18,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:13:18,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:13:18,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:13:18,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:13:18,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:13:18,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:13:18" (1/1) ... [2021-01-06 16:13:18,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c17ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:18, skipping insertion in model container [2021-01-06 16:13:18,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:13:18" (1/1) ... [2021-01-06 16:13:18,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:13:18,476 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],StructAccessExpression[IdentifierExpression[~list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] [2021-01-06 16:13:18,826 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem7,],offset]]]] [2021-01-06 16:13:18,835 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem13,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] [2021-01-06 16:13:18,838 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2021-01-06 16:13:18,839 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem17,],base],StructAccessExpression[IdentifierExpression[#t~mem17,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem18,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem18,],offset]]]] [2021-01-06 16:13:18,843 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2021-01-06 16:13:18,845 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] [2021-01-06 16:13:18,847 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2021-01-06 16:13:18,849 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2021-01-06 16:13:18,850 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] left hand side expression in assignment: lhs: VariableLHS[~inner~0,] [2021-01-06 16:13:18,852 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2021-01-06 16:13:18,858 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2021-01-06 16:13:18,860 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2021-01-06 16:13:18,864 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] [2021-01-06 16:13:18,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:13:18,889 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],StructAccessExpression[IdentifierExpression[~list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] [2021-01-06 16:13:18,925 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem7,],offset]]]] [2021-01-06 16:13:18,929 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem13,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] [2021-01-06 16:13:18,932 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2021-01-06 16:13:18,933 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem17,],base],StructAccessExpression[IdentifierExpression[#t~mem17,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem18,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem18,],offset]]]] [2021-01-06 16:13:18,937 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2021-01-06 16:13:18,938 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] [2021-01-06 16:13:18,940 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2021-01-06 16:13:18,941 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2021-01-06 16:13:18,942 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] left hand side expression in assignment: lhs: VariableLHS[~inner~0,] [2021-01-06 16:13:18,944 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2021-01-06 16:13:18,946 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2021-01-06 16:13:18,947 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2021-01-06 16:13:18,948 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] [2021-01-06 16:13:18,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:13:19,037 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:13:19,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:19 WrapperNode [2021-01-06 16:13:19,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:13:19,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:13:19,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:13:19,040 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:13:19,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:19" (1/1) ... [2021-01-06 16:13:19,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:19" (1/1) ... [2021-01-06 16:13:19,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:13:19,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:13:19,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:13:19,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:13:19,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:19" (1/1) ... [2021-01-06 16:13:19,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:19" (1/1) ... [2021-01-06 16:13:19,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:19" (1/1) ... [2021-01-06 16:13:19,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:19" (1/1) ... [2021-01-06 16:13:19,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:19" (1/1) ... [2021-01-06 16:13:19,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:19" (1/1) ... [2021-01-06 16:13:19,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:19" (1/1) ... [2021-01-06 16:13:19,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:13:19,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:13:19,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:13:19,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:13:19,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:19" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:13:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 16:13:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 16:13:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:13:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 16:13:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 16:13:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:13:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:13:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:13:20,219 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:13:20,219 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-01-06 16:13:20,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:13:20 BoogieIcfgContainer [2021-01-06 16:13:20,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:13:20,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:13:20,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:13:20,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:13:20,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:13:18" (1/3) ... [2021-01-06 16:13:20,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea8e689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:13:20, skipping insertion in model container [2021-01-06 16:13:20,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:19" (2/3) ... [2021-01-06 16:13:20,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea8e689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:13:20, skipping insertion in model container [2021-01-06 16:13:20,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:13:20" (3/3) ... [2021-01-06 16:13:20,242 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2021-01-06 16:13:20,251 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:13:20,259 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2021-01-06 16:13:20,282 INFO L253 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2021-01-06 16:13:20,339 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:13:20,339 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:13:20,339 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:13:20,340 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:13:20,341 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:13:20,341 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:13:20,341 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:13:20,341 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:13:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2021-01-06 16:13:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-06 16:13:20,384 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:20,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-06 16:13:20,386 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:20,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:20,393 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2021-01-06 16:13:20,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:20,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340048831] [2021-01-06 16:13:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:20,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340048831] [2021-01-06 16:13:20,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:20,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:13:20,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842066806] [2021-01-06 16:13:20,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:13:20,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:20,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:13:20,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:13:20,686 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2021-01-06 16:13:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:20,750 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2021-01-06 16:13:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:13:20,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-06 16:13:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:20,764 INFO L225 Difference]: With dead ends: 180 [2021-01-06 16:13:20,765 INFO L226 Difference]: Without dead ends: 95 [2021-01-06 16:13:20,769 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-06 16:13:20,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-01-06 16:13:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2021-01-06 16:13:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2021-01-06 16:13:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2021-01-06 16:13:20,818 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2021-01-06 16:13:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:20,819 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2021-01-06 16:13:20,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:13:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2021-01-06 16:13:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-06 16:13:20,820 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:20,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:20,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:13:20,821 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2021-01-06 16:13:20,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:20,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870632044] [2021-01-06 16:13:20,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:20,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870632044] [2021-01-06 16:13:20,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:20,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:13:20,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108060065] [2021-01-06 16:13:20,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:13:20,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:20,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:13:20,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:13:20,876 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 3 states. [2021-01-06 16:13:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:20,895 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2021-01-06 16:13:20,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:13:20,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2021-01-06 16:13:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:20,898 INFO L225 Difference]: With dead ends: 80 [2021-01-06 16:13:20,898 INFO L226 Difference]: Without dead ends: 78 [2021-01-06 16:13:20,900 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-06 16:13:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-01-06 16:13:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-01-06 16:13:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-01-06 16:13:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2021-01-06 16:13:20,911 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2021-01-06 16:13:20,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:20,912 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2021-01-06 16:13:20,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:13:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2021-01-06 16:13:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-06 16:13:20,913 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:20,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:20,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:13:20,914 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:20,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:20,914 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2021-01-06 16:13:20,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:20,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380879795] [2021-01-06 16:13:20,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:20,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380879795] [2021-01-06 16:13:20,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:20,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:13:20,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297024961] [2021-01-06 16:13:20,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:13:20,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:20,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:13:20,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:13:20,989 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 4 states. [2021-01-06 16:13:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:21,082 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2021-01-06 16:13:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:13:21,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-01-06 16:13:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:21,085 INFO L225 Difference]: With dead ends: 79 [2021-01-06 16:13:21,085 INFO L226 Difference]: Without dead ends: 77 [2021-01-06 16:13:21,086 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-06 16:13:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-01-06 16:13:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2021-01-06 16:13:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2021-01-06 16:13:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2021-01-06 16:13:21,095 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2021-01-06 16:13:21,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:21,096 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2021-01-06 16:13:21,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:13:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2021-01-06 16:13:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:13:21,097 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:21,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:21,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 16:13:21,098 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2021-01-06 16:13:21,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:21,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690265692] [2021-01-06 16:13:21,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:21,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690265692] [2021-01-06 16:13:21,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:21,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:13:21,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756790632] [2021-01-06 16:13:21,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:13:21,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:21,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:13:21,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:13:21,173 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 4 states. [2021-01-06 16:13:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:21,316 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2021-01-06 16:13:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:13:21,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2021-01-06 16:13:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:21,319 INFO L225 Difference]: With dead ends: 195 [2021-01-06 16:13:21,319 INFO L226 Difference]: Without dead ends: 128 [2021-01-06 16:13:21,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:13:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-01-06 16:13:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2021-01-06 16:13:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2021-01-06 16:13:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2021-01-06 16:13:21,330 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2021-01-06 16:13:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:21,330 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2021-01-06 16:13:21,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:13:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2021-01-06 16:13:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:13:21,331 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:21,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:21,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 16:13:21,332 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:21,333 INFO L82 PathProgramCache]: Analyzing trace with hash 903272487, now seen corresponding path program 1 times [2021-01-06 16:13:21,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:21,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584404491] [2021-01-06 16:13:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:21,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584404491] [2021-01-06 16:13:21,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:21,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:13:21,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388758238] [2021-01-06 16:13:21,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:13:21,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:21,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:13:21,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:13:21,421 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2021-01-06 16:13:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:21,561 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2021-01-06 16:13:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:13:21,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2021-01-06 16:13:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:21,563 INFO L225 Difference]: With dead ends: 122 [2021-01-06 16:13:21,564 INFO L226 Difference]: Without dead ends: 118 [2021-01-06 16:13:21,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:13:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-01-06 16:13:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 73. [2021-01-06 16:13:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-01-06 16:13:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2021-01-06 16:13:21,572 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 15 [2021-01-06 16:13:21,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:21,573 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2021-01-06 16:13:21,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:13:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2021-01-06 16:13:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:13:21,574 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:21,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:21,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 16:13:21,574 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:21,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:21,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2021-01-06 16:13:21,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:21,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895752277] [2021-01-06 16:13:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:21,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895752277] [2021-01-06 16:13:21,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:21,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:13:21,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592867560] [2021-01-06 16:13:21,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:13:21,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:21,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:13:21,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:13:21,634 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 4 states. [2021-01-06 16:13:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:21,717 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2021-01-06 16:13:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:13:21,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-01-06 16:13:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:21,719 INFO L225 Difference]: With dead ends: 132 [2021-01-06 16:13:21,719 INFO L226 Difference]: Without dead ends: 112 [2021-01-06 16:13:21,720 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:13:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-01-06 16:13:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2021-01-06 16:13:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2021-01-06 16:13:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2021-01-06 16:13:21,727 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2021-01-06 16:13:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:21,728 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2021-01-06 16:13:21,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:13:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2021-01-06 16:13:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 16:13:21,729 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:21,729 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-06 16:13:21,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 16:13:21,729 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:21,730 INFO L82 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2021-01-06 16:13:21,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:21,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070382844] [2021-01-06 16:13:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:21,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070382844] [2021-01-06 16:13:21,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:21,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:13:21,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447029354] [2021-01-06 16:13:21,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:13:21,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:21,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:13:21,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:13:21,769 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2021-01-06 16:13:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:21,784 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2021-01-06 16:13:21,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:13:21,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-01-06 16:13:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:21,785 INFO L225 Difference]: With dead ends: 137 [2021-01-06 16:13:21,785 INFO L226 Difference]: Without dead ends: 96 [2021-01-06 16:13:21,786 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-06 16:13:21,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-01-06 16:13:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2021-01-06 16:13:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2021-01-06 16:13:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2021-01-06 16:13:21,793 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2021-01-06 16:13:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:21,793 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2021-01-06 16:13:21,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:13:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2021-01-06 16:13:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 16:13:21,794 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:21,795 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:21,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 16:13:21,795 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2021-01-06 16:13:21,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:21,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023673285] [2021-01-06 16:13:21,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:21,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023673285] [2021-01-06 16:13:21,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:21,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:13:21,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792900257] [2021-01-06 16:13:21,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:13:21,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:21,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:13:21,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:13:21,858 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2021-01-06 16:13:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:21,883 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2021-01-06 16:13:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:13:21,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-01-06 16:13:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:21,885 INFO L225 Difference]: With dead ends: 75 [2021-01-06 16:13:21,885 INFO L226 Difference]: Without dead ends: 73 [2021-01-06 16:13:21,886 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-06 16:13:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-01-06 16:13:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-01-06 16:13:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-01-06 16:13:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2021-01-06 16:13:21,898 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2021-01-06 16:13:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:21,898 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2021-01-06 16:13:21,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:13:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2021-01-06 16:13:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 16:13:21,900 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:21,900 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] [2021-01-06 16:13:21,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 16:13:21,901 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:21,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:21,901 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2021-01-06 16:13:21,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:21,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267176095] [2021-01-06 16:13:21,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:22,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267176095] [2021-01-06 16:13:22,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:22,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:13:22,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716652804] [2021-01-06 16:13:22,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:13:22,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:22,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:13:22,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:13:22,007 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 4 states. [2021-01-06 16:13:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:22,100 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2021-01-06 16:13:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:13:22,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2021-01-06 16:13:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:22,103 INFO L225 Difference]: With dead ends: 74 [2021-01-06 16:13:22,103 INFO L226 Difference]: Without dead ends: 72 [2021-01-06 16:13:22,103 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-06 16:13:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-01-06 16:13:22,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2021-01-06 16:13:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-01-06 16:13:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-01-06 16:13:22,125 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2021-01-06 16:13:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:22,125 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-01-06 16:13:22,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:13:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-01-06 16:13:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 16:13:22,130 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:22,130 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-06 16:13:22,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 16:13:22,131 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:22,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:22,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2021-01-06 16:13:22,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:22,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526010167] [2021-01-06 16:13:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:22,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526010167] [2021-01-06 16:13:22,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:22,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 16:13:22,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072458004] [2021-01-06 16:13:22,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 16:13:22,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:22,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 16:13:22,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:13:22,309 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 7 states. [2021-01-06 16:13:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:22,607 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2021-01-06 16:13:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 16:13:22,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2021-01-06 16:13:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:22,609 INFO L225 Difference]: With dead ends: 199 [2021-01-06 16:13:22,609 INFO L226 Difference]: Without dead ends: 157 [2021-01-06 16:13:22,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-01-06 16:13:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-01-06 16:13:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 93. [2021-01-06 16:13:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2021-01-06 16:13:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2021-01-06 16:13:22,617 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 24 [2021-01-06 16:13:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:22,618 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2021-01-06 16:13:22,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 16:13:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2021-01-06 16:13:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 16:13:22,619 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:22,619 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-06 16:13:22,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 16:13:22,620 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:22,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:22,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2021-01-06 16:13:22,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:22,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481166108] [2021-01-06 16:13:22,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:22,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481166108] [2021-01-06 16:13:22,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:22,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 16:13:22,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62695032] [2021-01-06 16:13:22,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 16:13:22,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:22,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 16:13:22,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:13:22,780 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 7 states. [2021-01-06 16:13:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:23,375 INFO L93 Difference]: Finished difference Result 246 states and 274 transitions. [2021-01-06 16:13:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 16:13:23,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2021-01-06 16:13:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:23,379 INFO L225 Difference]: With dead ends: 246 [2021-01-06 16:13:23,379 INFO L226 Difference]: Without dead ends: 244 [2021-01-06 16:13:23,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 16:13:23,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-01-06 16:13:23,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 105. [2021-01-06 16:13:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-01-06 16:13:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2021-01-06 16:13:23,389 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 24 [2021-01-06 16:13:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:23,389 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2021-01-06 16:13:23,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 16:13:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2021-01-06 16:13:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 16:13:23,391 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:23,391 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-06 16:13:23,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 16:13:23,391 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:23,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:23,392 INFO L82 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2021-01-06 16:13:23,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:23,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040249206] [2021-01-06 16:13:23,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:13:23,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040249206] [2021-01-06 16:13:23,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:23,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:13:23,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548801627] [2021-01-06 16:13:23,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:13:23,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:23,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:13:23,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:13:23,456 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 5 states. [2021-01-06 16:13:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:23,599 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2021-01-06 16:13:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:13:23,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2021-01-06 16:13:23,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:23,601 INFO L225 Difference]: With dead ends: 156 [2021-01-06 16:13:23,601 INFO L226 Difference]: Without dead ends: 138 [2021-01-06 16:13:23,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:13:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-01-06 16:13:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2021-01-06 16:13:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2021-01-06 16:13:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 153 transitions. [2021-01-06 16:13:23,612 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 153 transitions. Word has length 26 [2021-01-06 16:13:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:23,612 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 153 transitions. [2021-01-06 16:13:23,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:13:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2021-01-06 16:13:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 16:13:23,614 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:23,614 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-06 16:13:23,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 16:13:23,614 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:23,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:23,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2021-01-06 16:13:23,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:23,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840680732] [2021-01-06 16:13:23,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:13:23,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840680732] [2021-01-06 16:13:23,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:23,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:13:23,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70292420] [2021-01-06 16:13:23,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:13:23,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:23,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:13:23,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:13:23,655 INFO L87 Difference]: Start difference. First operand 130 states and 153 transitions. Second operand 3 states. [2021-01-06 16:13:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:23,705 INFO L93 Difference]: Finished difference Result 130 states and 153 transitions. [2021-01-06 16:13:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:13:23,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2021-01-06 16:13:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:23,707 INFO L225 Difference]: With dead ends: 130 [2021-01-06 16:13:23,707 INFO L226 Difference]: Without dead ends: 128 [2021-01-06 16:13:23,708 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-06 16:13:23,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-01-06 16:13:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2021-01-06 16:13:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2021-01-06 16:13:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 151 transitions. [2021-01-06 16:13:23,716 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 151 transitions. Word has length 26 [2021-01-06 16:13:23,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:23,717 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 151 transitions. [2021-01-06 16:13:23,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:13:23,717 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 151 transitions. [2021-01-06 16:13:23,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 16:13:23,718 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:23,718 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-06 16:13:23,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 16:13:23,719 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:23,719 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2021-01-06 16:13:23,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:23,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711825704] [2021-01-06 16:13:23,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 16:13:23,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 16:13:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 16:13:23,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 16:13:23,785 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 16:13:23,785 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 16:13:23,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 16:13:23,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 04:13:23 BoogieIcfgContainer [2021-01-06 16:13:23,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 16:13:23,840 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 16:13:23,840 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 16:13:23,840 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 16:13:23,841 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:13:20" (3/4) ... [2021-01-06 16:13:23,843 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 16:13:23,894 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/forester-heap/dll-01-1.i-witness.graphml [2021-01-06 16:13:23,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 16:13:23,896 INFO L168 Benchmark]: Toolchain (without parser) took 5503.86 ms. Allocated memory was 161.5 MB in the beginning and 196.1 MB in the end (delta: 34.6 MB). Free memory was 135.9 MB in the beginning and 104.6 MB in the end (delta: 31.3 MB). Peak memory consumption was 66.4 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:23,897 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 161.5 MB. Free memory was 133.7 MB in the beginning and 133.6 MB in the end (delta: 94.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:13:23,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.62 ms. Allocated memory is still 161.5 MB. Free memory was 135.7 MB in the beginning and 143.2 MB in the end (delta: -7.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:23,898 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.89 ms. Allocated memory is still 161.5 MB. Free memory was 143.2 MB in the beginning and 141.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:23,899 INFO L168 Benchmark]: Boogie Preprocessor took 101.60 ms. Allocated memory is still 161.5 MB. Free memory was 141.1 MB in the beginning and 139.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:23,899 INFO L168 Benchmark]: RCFGBuilder took 1006.29 ms. Allocated memory is still 161.5 MB. Free memory was 139.0 MB in the beginning and 103.8 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.7 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:23,900 INFO L168 Benchmark]: TraceAbstraction took 3612.65 ms. Allocated memory was 161.5 MB in the beginning and 196.1 MB in the end (delta: 34.6 MB). Free memory was 103.3 MB in the beginning and 107.3 MB in the end (delta: -3.9 MB). Peak memory consumption was 31.2 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:23,900 INFO L168 Benchmark]: Witness Printer took 53.80 ms. Allocated memory is still 196.1 MB. Free memory was 107.3 MB in the beginning and 104.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:23,904 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 161.5 MB. Free memory was 133.7 MB in the beginning and 133.6 MB in the end (delta: 94.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 641.62 ms. Allocated memory is still 161.5 MB. Free memory was 135.7 MB in the beginning and 143.2 MB in the end (delta: -7.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 67.89 ms. Allocated memory is still 161.5 MB. Free memory was 143.2 MB in the beginning and 141.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 101.60 ms. Allocated memory is still 161.5 MB. Free memory was 141.1 MB in the beginning and 139.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1006.29 ms. Allocated memory is still 161.5 MB. Free memory was 139.0 MB in the beginning and 103.8 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3612.65 ms. Allocated memory was 161.5 MB in the beginning and 196.1 MB in the end (delta: 34.6 MB). Free memory was 103.3 MB in the beginning and 107.3 MB in the end (delta: -3.9 MB). Peak memory consumption was 31.2 MB. Max. memory is 8.0 GB. * Witness Printer took 53.80 ms. Allocated memory is still 196.1 MB. Free memory was 107.3 MB in the beginning and 104.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) [L1005] list->prev = ((void*)0) [L1006] COND FALSE !(!(list != ((void*)0))) [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) [L1006] EXPR list->inner [L1006] list->inner->next = ((void*)0) [L1006] EXPR list->inner [L1006] list->inner->inner = ((void*)0) [L1006] EXPR list->inner [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list [L1026] COND FALSE !(!(((void*)0) != end)) [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; [L1031] EXPR end->inner [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner [L1034] COND TRUE len == 0 [L1035] len = 1 [L1038] COND FALSE !(!(((void*)0) != inner)) [L1039] EXPR inner->inner [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 943 SDtfs, 1062 SDslu, 1246 SDs, 0 SdLazy, 657 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 389 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 33174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...