./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-circular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:02:04,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:02:04,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:02:04,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:02:04,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:02:04,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:02:04,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:02:04,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:02:04,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:02:04,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:02:04,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:02:04,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:02:04,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:02:04,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:02:04,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:02:04,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:02:04,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:02:04,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:02:04,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:02:04,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:02:04,992 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:02:04,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:02:04,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:02:04,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:02:04,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:02:05,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:02:05,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:02:05,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:02:05,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:02:05,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:02:05,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:02:05,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:02:05,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:02:05,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:02:05,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:02:05,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:02:05,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:02:05,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:02:05,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:02:05,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:02:05,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:02:05,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:02:05,013 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:02:05,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:02:05,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:02:05,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:02:05,033 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:02:05,034 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:02:05,034 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:02:05,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:02:05,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:02:05,035 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:02:05,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:02:05,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:02:05,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:02:05,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:02:05,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:02:05,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:02:05,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:02:05,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:02:05,037 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:02:05,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:02:05,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:02:05,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:02:05,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:02:05,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:02:05,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:02:05,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:05,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:02:05,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:02:05,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:02:05,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:02:05,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:02:05,039 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:02:05,039 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:02:05,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:02:05,040 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2022-07-13 15:02:05,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:02:05,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:02:05,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:02:05,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:02:05,260 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:02:05,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-07-13 15:02:05,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63fe5fee/ea412c4240554b0bb395f0905222885c/FLAGa1561dd2b [2022-07-13 15:02:05,716 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:02:05,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-07-13 15:02:05,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63fe5fee/ea412c4240554b0bb395f0905222885c/FLAGa1561dd2b [2022-07-13 15:02:05,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63fe5fee/ea412c4240554b0bb395f0905222885c [2022-07-13 15:02:05,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:02:05,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:02:05,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:05,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:02:05,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:02:05,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:05" (1/1) ... [2022-07-13 15:02:05,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137a0357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:05, skipping insertion in model container [2022-07-13 15:02:05,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:05" (1/1) ... [2022-07-13 15:02:05,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:02:05,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:02:06,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2022-07-13 15:02:06,019 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2022-07-13 15:02:06,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2022-07-13 15:02:06,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:06,030 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:02:06,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2022-07-13 15:02:06,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2022-07-13 15:02:06,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2022-07-13 15:02:06,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:06,126 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:02:06,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06 WrapperNode [2022-07-13 15:02:06,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:06,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:06,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:02:06,129 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:02:06,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,166 INFO L137 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-07-13 15:02:06,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:06,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:02:06,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:02:06,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:02:06,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:02:06,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:02:06,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:02:06,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:02:06,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:06,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:06,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:02:06,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:02:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:02:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:02:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:02:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:02:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:02:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:02:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:02:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:02:06,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:02:06,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:02:06,333 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:02:06,335 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:02:06,561 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:02:06,566 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:02:06,566 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-13 15:02:06,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:06 BoogieIcfgContainer [2022-07-13 15:02:06,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:02:06,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:02:06,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:02:06,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:02:06,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:02:05" (1/3) ... [2022-07-13 15:02:06,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519ef458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:06, skipping insertion in model container [2022-07-13 15:02:06,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (2/3) ... [2022-07-13 15:02:06,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519ef458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:06, skipping insertion in model container [2022-07-13 15:02:06,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:06" (3/3) ... [2022-07-13 15:02:06,577 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2022-07-13 15:02:06,589 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:02:06,590 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-13 15:02:06,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:02:06,650 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47fafd19, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a620f44 [2022-07-13 15:02:06,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-13 15:02:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 15:02:06,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:06,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 15:02:06,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:06,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash 890892102, now seen corresponding path program 1 times [2022-07-13 15:02:06,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:06,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952075365] [2022-07-13 15:02:06,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:06,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:06,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:06,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952075365] [2022-07-13 15:02:06,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952075365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:06,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:06,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:02:06,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024417626] [2022-07-13 15:02:06,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:06,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:02:06,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:06,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:02:06,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:02:06,881 INFO L87 Difference]: Start difference. First operand has 33 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:06,895 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-07-13 15:02:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:02:06,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-13 15:02:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:06,902 INFO L225 Difference]: With dead ends: 64 [2022-07-13 15:02:06,902 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 15:02:06,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:02:06,907 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:06,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 15:02:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-13 15:02:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-07-13 15:02:06,937 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 6 [2022-07-13 15:02:06,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:06,937 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-07-13 15:02:06,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-07-13 15:02:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 15:02:06,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:06,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:06,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:02:06,940 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:06,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:06,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1806883023, now seen corresponding path program 1 times [2022-07-13 15:02:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:06,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464705173] [2022-07-13 15:02:06,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:06,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:07,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:07,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464705173] [2022-07-13 15:02:07,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464705173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:07,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:07,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:07,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567112156] [2022-07-13 15:02:07,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:07,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:07,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:07,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:07,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:07,130 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:07,181 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-07-13 15:02:07,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:07,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-13 15:02:07,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:07,182 INFO L225 Difference]: With dead ends: 42 [2022-07-13 15:02:07,182 INFO L226 Difference]: Without dead ends: 38 [2022-07-13 15:02:07,183 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:02:07,184 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:07,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 47 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-13 15:02:07,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-07-13 15:02:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-13 15:02:07,190 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 7 [2022-07-13 15:02:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:07,190 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-13 15:02:07,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-13 15:02:07,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 15:02:07,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:07,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:07,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:02:07,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:07,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash 706691337, now seen corresponding path program 1 times [2022-07-13 15:02:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:07,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302479356] [2022-07-13 15:02:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:07,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:07,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302479356] [2022-07-13 15:02:07,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302479356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:07,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:07,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162954049] [2022-07-13 15:02:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:07,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:07,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:07,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:07,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:07,260 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:07,275 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-07-13 15:02:07,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:07,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 15:02:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:07,277 INFO L225 Difference]: With dead ends: 71 [2022-07-13 15:02:07,277 INFO L226 Difference]: Without dead ends: 49 [2022-07-13 15:02:07,278 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:02:07,279 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:07,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-13 15:02:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-07-13 15:02:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-07-13 15:02:07,285 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 10 [2022-07-13 15:02:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:07,285 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-07-13 15:02:07,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-07-13 15:02:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 15:02:07,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:07,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:07,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:02:07,287 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash -84804677, now seen corresponding path program 1 times [2022-07-13 15:02:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:07,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836750325] [2022-07-13 15:02:07,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:07,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:07,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:07,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836750325] [2022-07-13 15:02:07,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836750325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:07,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:07,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:07,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502512850] [2022-07-13 15:02:07,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:07,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:07,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:07,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:07,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:07,329 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:07,339 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-13 15:02:07,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:07,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 15:02:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:07,340 INFO L225 Difference]: With dead ends: 38 [2022-07-13 15:02:07,340 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 15:02:07,343 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:02:07,345 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:07,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 15:02:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-13 15:02:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-13 15:02:07,350 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 13 [2022-07-13 15:02:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:07,351 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-13 15:02:07,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-13 15:02:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 15:02:07,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:07,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:07,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 15:02:07,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash -84802755, now seen corresponding path program 1 times [2022-07-13 15:02:07,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:07,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90505274] [2022-07-13 15:02:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:07,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90505274] [2022-07-13 15:02:07,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90505274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:07,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:07,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:02:07,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573191642] [2022-07-13 15:02:07,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:07,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:02:07,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:07,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:02:07,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:07,537 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:07,677 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-07-13 15:02:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:02:07,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 15:02:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:07,679 INFO L225 Difference]: With dead ends: 47 [2022-07-13 15:02:07,679 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 15:02:07,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:02:07,681 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:07,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:07,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 15:02:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-13 15:02:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-07-13 15:02:07,693 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 13 [2022-07-13 15:02:07,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:07,693 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-07-13 15:02:07,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-07-13 15:02:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 15:02:07,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:07,698 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:07,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 15:02:07,698 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:07,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:07,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1783178116, now seen corresponding path program 1 times [2022-07-13 15:02:07,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:07,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188207767] [2022-07-13 15:02:07,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:07,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:07,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:07,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:07,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188207767] [2022-07-13 15:02:07,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188207767] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:07,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245620397] [2022-07-13 15:02:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:07,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:07,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:07,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:07,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:02:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:07,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 15:02:07,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:07,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:02:08,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-07-13 15:02:08,047 INFO L356 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-07-13 15:02:08,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 53 [2022-07-13 15:02:08,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-13 15:02:08,061 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:02:08,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-13 15:02:08,100 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:02:08,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-13 15:02:08,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-07-13 15:02:08,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-07-13 15:02:08,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:08,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:08,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-13 15:02:08,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:02:08,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2022-07-13 15:02:08,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:02:08,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 334 treesize of output 225 [2022-07-13 15:02:08,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 196 [2022-07-13 15:02:08,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 192 [2022-07-13 15:02:08,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 180 [2022-07-13 15:02:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-13 15:02:08,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245620397] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:02:08,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:02:08,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-13 15:02:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297614673] [2022-07-13 15:02:08,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:02:08,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 15:02:08,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:08,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 15:02:08,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2022-07-13 15:02:08,453 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:08,541 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-07-13 15:02:08,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:02:08,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 15:02:08,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:08,544 INFO L225 Difference]: With dead ends: 61 [2022-07-13 15:02:08,544 INFO L226 Difference]: Without dead ends: 59 [2022-07-13 15:02:08,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2022-07-13 15:02:08,545 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:08,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 109 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-07-13 15:02:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-13 15:02:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-07-13 15:02:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-07-13 15:02:08,554 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 13 [2022-07-13 15:02:08,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:08,554 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-07-13 15:02:08,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-07-13 15:02:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:02:08,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:08,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:08,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 15:02:08,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 15:02:08,766 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:08,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:08,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1644077251, now seen corresponding path program 1 times [2022-07-13 15:02:08,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:08,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187380544] [2022-07-13 15:02:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:08,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:08,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187380544] [2022-07-13 15:02:08,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187380544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:08,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:08,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405920219] [2022-07-13 15:02:08,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:08,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:08,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:08,893 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:08,912 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-07-13 15:02:08,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:08,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-13 15:02:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:08,914 INFO L225 Difference]: With dead ends: 96 [2022-07-13 15:02:08,914 INFO L226 Difference]: Without dead ends: 73 [2022-07-13 15:02:08,914 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:02:08,915 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:08,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 70 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-13 15:02:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2022-07-13 15:02:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-07-13 15:02:08,928 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 17 [2022-07-13 15:02:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:08,932 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-07-13 15:02:08,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-07-13 15:02:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:02:08,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:08,934 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:08,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 15:02:08,934 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:08,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:08,937 INFO L85 PathProgramCache]: Analyzing trace with hash 619754034, now seen corresponding path program 1 times [2022-07-13 15:02:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:08,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555770610] [2022-07-13 15:02:08,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:09,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:09,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555770610] [2022-07-13 15:02:09,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555770610] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:09,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401363516] [2022-07-13 15:02:09,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:09,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:09,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:09,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:09,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 15:02:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:09,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-13 15:02:09,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:09,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:02:09,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:09,336 INFO L356 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2022-07-13 15:02:09,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 253 treesize of output 190 [2022-07-13 15:02:09,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:09,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-07-13 15:02:09,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-07-13 15:02:09,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,407 INFO L356 Elim1Store]: treesize reduction 136, result has 3.5 percent of original size [2022-07-13 15:02:09,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 186 treesize of output 204 [2022-07-13 15:02:09,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:09,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2022-07-13 15:02:09,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:09,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-13 15:02:09,467 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:02:09,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 15:02:09,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:02:09,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:02:09,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:02:09,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:02:09,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:02:09,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:09,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2022-07-13 15:02:09,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 15:02:09,705 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:02:09,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-13 15:02:09,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:02:09,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:09,731 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:02:09,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-07-13 15:02:09,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-07-13 15:02:09,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,850 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:02:09,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 76 [2022-07-13 15:02:09,863 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-13 15:02:09,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2022-07-13 15:02:09,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-13 15:02:10,028 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-13 15:02:10,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 61 [2022-07-13 15:02:10,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:10,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-07-13 15:02:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:10,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:10,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_639 (Array Int Int)) (v_ArrVal_636 Int) (v_ArrVal_635 Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_636))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_635)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_639) (select (select .cse0 .cse1) .cse2)) (+ 8 (select (select .cse3 .cse1) .cse2)))))) 0)) is different from false [2022-07-13 15:02:10,309 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-07-13 15:02:10,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 4646 treesize of output 3639 [2022-07-13 15:02:10,474 INFO L356 Elim1Store]: treesize reduction 27, result has 64.9 percent of original size [2022-07-13 15:02:10,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26520 treesize of output 18457 [2022-07-13 15:02:13,656 INFO L356 Elim1Store]: treesize reduction 371, result has 64.4 percent of original size [2022-07-13 15:02:13,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 950378 treesize of output 861247 [2022-07-13 15:02:27,366 WARN L233 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 314 DAG size of output: 290 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-13 15:02:27,370 INFO L356 Elim1Store]: treesize reduction 180, result has 86.1 percent of original size [2022-07-13 15:02:27,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 14 new quantified variables, introduced 66 case distinctions, treesize of input 25549216 treesize of output 23854102 [2022-07-13 15:03:30,798 WARN L233 SmtUtils]: Spent 1.06m on a formula simplification. DAG size of input: 16246 DAG size of output: 16246 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)