./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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/list-simple/dll2n_prepend_equal.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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 00:47:25,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 00:47:25,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 00:47:25,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 00:47:25,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 00:47:25,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 00:47:25,149 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 00:47:25,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 00:47:25,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 00:47:25,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 00:47:25,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 00:47:25,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 00:47:25,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 00:47:25,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 00:47:25,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 00:47:25,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 00:47:25,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 00:47:25,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 00:47:25,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 00:47:25,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 00:47:25,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 00:47:25,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 00:47:25,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 00:47:25,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 00:47:25,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 00:47:25,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 00:47:25,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 00:47:25,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 00:47:25,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 00:47:25,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 00:47:25,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 00:47:25,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 00:47:25,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 00:47:25,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 00:47:25,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 00:47:25,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 00:47:25,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 00:47:25,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 00:47:25,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 00:47:25,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 00:47:25,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 00:47:25,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 00:47:25,220 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 00:47:25,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 00:47:25,221 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 00:47:25,221 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 00:47:25,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 00:47:25,222 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 00:47:25,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 00:47:25,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 00:47:25,223 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 00:47:25,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 00:47:25,224 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 00:47:25,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 00:47:25,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 00:47:25,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 00:47:25,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 00:47:25,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 00:47:25,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 00:47:25,225 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 00:47:25,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 00:47:25,225 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 00:47:25,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 00:47:25,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 00:47:25,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 00:47:25,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 00:47:25,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:47:25,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 00:47:25,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 00:47:25,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 00:47:25,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 00:47:25,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 00:47:25,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 00:47:25,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 00:47:25,227 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 00:47:25,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 00:47:25,227 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 00:47:25,228 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2023-02-17 00:47:25,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 00:47:25,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 00:47:25,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 00:47:25,418 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 00:47:25,419 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 00:47:25,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2023-02-17 00:47:26,377 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 00:47:26,623 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 00:47:26,624 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2023-02-17 00:47:26,634 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663538d72/a18bafe29e1549cfac3e5364e1a37034/FLAG36b3b0fa0 [2023-02-17 00:47:26,644 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663538d72/a18bafe29e1549cfac3e5364e1a37034 [2023-02-17 00:47:26,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 00:47:26,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 00:47:26,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 00:47:26,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 00:47:26,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 00:47:26,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:26,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@421d1ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26, skipping insertion in model container [2023-02-17 00:47:26,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:26,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 00:47:26,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 00:47:26,903 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2023-02-17 00:47:26,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:47:26,916 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 00:47:26,942 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2023-02-17 00:47:26,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:47:26,959 INFO L208 MainTranslator]: Completed translation [2023-02-17 00:47:26,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26 WrapperNode [2023-02-17 00:47:26,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 00:47:26,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 00:47:26,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 00:47:26,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 00:47:26,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:26,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:26,995 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2023-02-17 00:47:26,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 00:47:26,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 00:47:26,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 00:47:26,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 00:47:27,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:27,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:27,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:27,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:27,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:27,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:27,019 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:27,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:27,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 00:47:27,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 00:47:27,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 00:47:27,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 00:47:27,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26" (1/1) ... [2023-02-17 00:47:27,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:47:27,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:47:27,063 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) [2023-02-17 00:47:27,078 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 [2023-02-17 00:47:27,088 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-17 00:47:27,089 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-17 00:47:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 00:47:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 00:47:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 00:47:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 00:47:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 00:47:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 00:47:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 00:47:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 00:47:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 00:47:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 00:47:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 00:47:27,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 00:47:27,174 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 00:47:27,176 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 00:47:27,207 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-17 00:47:27,333 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 00:47:27,337 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 00:47:27,337 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-17 00:47:27,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:47:27 BoogieIcfgContainer [2023-02-17 00:47:27,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 00:47:27,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 00:47:27,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 00:47:27,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 00:47:27,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 12:47:26" (1/3) ... [2023-02-17 00:47:27,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cc1f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:47:27, skipping insertion in model container [2023-02-17 00:47:27,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:47:26" (2/3) ... [2023-02-17 00:47:27,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cc1f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:47:27, skipping insertion in model container [2023-02-17 00:47:27,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:47:27" (3/3) ... [2023-02-17 00:47:27,344 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2023-02-17 00:47:27,355 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 00:47:27,355 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 00:47:27,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 00:47:27,389 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@19bae1ab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 00:47:27,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 00:47:27,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:47:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 00:47:27,397 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:47:27,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:47:27,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:47:27,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:47:27,402 INFO L85 PathProgramCache]: Analyzing trace with hash 692830707, now seen corresponding path program 1 times [2023-02-17 00:47:27,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:47:27,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798603698] [2023-02-17 00:47:27,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:47:27,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:47:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:47:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:47:27,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:47:27,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798603698] [2023-02-17 00:47:27,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798603698] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:47:27,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:47:27,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 00:47:27,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014658428] [2023-02-17 00:47:27,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:47:27,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 00:47:27,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:47:27,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 00:47:27,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 00:47:27,568 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2023-02-17 00:47:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:47:27,580 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2023-02-17 00:47:27,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 00:47:27,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2023-02-17 00:47:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:47:27,587 INFO L225 Difference]: With dead ends: 50 [2023-02-17 00:47:27,587 INFO L226 Difference]: Without dead ends: 20 [2023-02-17 00:47:27,601 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 [2023-02-17 00:47:27,605 INFO L413 NwaCegarLoop]: 36 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, 36 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 [2023-02-17 00:47:27,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:47:27,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-17 00:47:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-17 00:47:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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) [2023-02-17 00:47:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-02-17 00:47:27,639 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2023-02-17 00:47:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:47:27,639 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-02-17 00:47:27,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2023-02-17 00:47:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-02-17 00:47:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 00:47:27,641 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:47:27,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:47:27,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 00:47:27,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:47:27,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:47:27,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1759740954, now seen corresponding path program 1 times [2023-02-17 00:47:27,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:47:27,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743437179] [2023-02-17 00:47:27,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:47:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:47:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:47:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:47:27,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:47:27,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743437179] [2023-02-17 00:47:27,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743437179] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:47:27,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:47:27,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:47:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579058040] [2023-02-17 00:47:27,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:47:27,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:47:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:47:27,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:47:27,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:47:27,805 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-02-17 00:47:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:47:27,814 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-02-17 00:47:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:47:27,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2023-02-17 00:47:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:47:27,816 INFO L225 Difference]: With dead ends: 38 [2023-02-17 00:47:27,816 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 00:47:27,816 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 [2023-02-17 00:47:27,817 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:47:27,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:47:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 00:47:27,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2023-02-17 00:47:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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) [2023-02-17 00:47:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-02-17 00:47:27,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2023-02-17 00:47:27,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:47:27,821 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-02-17 00:47:27,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-02-17 00:47:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-02-17 00:47:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 00:47:27,822 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:47:27,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:47:27,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 00:47:27,823 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:47:27,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:47:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash 675600054, now seen corresponding path program 1 times [2023-02-17 00:47:27,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:47:27,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501150083] [2023-02-17 00:47:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:47:27,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:47:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:47:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:47:27,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:47:27,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501150083] [2023-02-17 00:47:27,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501150083] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:47:27,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:47:27,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:47:27,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307025110] [2023-02-17 00:47:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:47:27,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:47:27,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:47:27,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:47:27,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:47:27,923 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2023-02-17 00:47:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:47:27,948 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2023-02-17 00:47:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:47:27,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2023-02-17 00:47:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:47:27,950 INFO L225 Difference]: With dead ends: 43 [2023-02-17 00:47:27,950 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 00:47:27,950 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 [2023-02-17 00:47:27,951 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:47:27,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:47:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 00:47:27,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-02-17 00:47:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2023-02-17 00:47:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-02-17 00:47:27,964 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2023-02-17 00:47:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:47:27,964 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-02-17 00:47:27,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2023-02-17 00:47:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-02-17 00:47:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 00:47:27,965 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:47:27,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:47:27,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 00:47:27,966 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:47:27,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:47:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash -335517196, now seen corresponding path program 1 times [2023-02-17 00:47:27,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:47:27,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841921835] [2023-02-17 00:47:27,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:47:27,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:47:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:47:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:47:28,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:47:28,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841921835] [2023-02-17 00:47:28,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841921835] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:47:28,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551096074] [2023-02-17 00:47:28,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:47:28,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:47:28,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:47:28,054 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) [2023-02-17 00:47:28,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 00:47:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:47:28,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 00:47:28,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:47:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:47:28,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:47:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:47:28,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551096074] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:47:28,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:47:28,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-17 00:47:28,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469275054] [2023-02-17 00:47:28,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:47:28,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 00:47:28,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:47:28,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 00:47:28,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-17 00:47:28,261 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2023-02-17 00:47:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:47:28,278 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2023-02-17 00:47:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 00:47:28,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 19 [2023-02-17 00:47:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:47:28,280 INFO L225 Difference]: With dead ends: 39 [2023-02-17 00:47:28,280 INFO L226 Difference]: Without dead ends: 26 [2023-02-17 00:47:28,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-17 00:47:28,285 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:47:28,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:47:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-17 00:47:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-17 00:47:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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) [2023-02-17 00:47:28,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-02-17 00:47:28,294 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2023-02-17 00:47:28,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:47:28,295 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-02-17 00:47:28,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2023-02-17 00:47:28,295 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-02-17 00:47:28,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 00:47:28,297 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:47:28,297 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:47:28,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 00:47:28,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:47:28,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:47:28,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:47:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1568046744, now seen corresponding path program 1 times [2023-02-17 00:47:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:47:28,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111262973] [2023-02-17 00:47:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:47:28,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:47:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:47:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:47:29,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:47:29,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111262973] [2023-02-17 00:47:29,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111262973] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:47:29,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:47:29,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-17 00:47:29,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575249414] [2023-02-17 00:47:29,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:47:29,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 00:47:29,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:47:29,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 00:47:29,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-02-17 00:47:29,243 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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) [2023-02-17 00:47:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:47:29,501 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-02-17 00:47:29,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 00:47:29,502 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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 24 [2023-02-17 00:47:29,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:47:29,502 INFO L225 Difference]: With dead ends: 34 [2023-02-17 00:47:29,502 INFO L226 Difference]: Without dead ends: 32 [2023-02-17 00:47:29,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2023-02-17 00:47:29,505 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 94 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 00:47:29,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 38 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 00:47:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-17 00:47:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-02-17 00:47:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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) [2023-02-17 00:47:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-02-17 00:47:29,511 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 24 [2023-02-17 00:47:29,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:47:29,511 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-02-17 00:47:29,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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) [2023-02-17 00:47:29,512 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-02-17 00:47:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 00:47:29,513 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:47:29,513 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:47:29,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 00:47:29,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:47:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:47:29,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1568048418, now seen corresponding path program 1 times [2023-02-17 00:47:29,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:47:29,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337100633] [2023-02-17 00:47:29,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:47:29,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:47:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:47:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 00:47:29,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:47:29,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337100633] [2023-02-17 00:47:29,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337100633] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:47:29,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:47:29,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 00:47:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572346231] [2023-02-17 00:47:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:47:29,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 00:47:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:47:29,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 00:47:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 00:47:29,653 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) [2023-02-17 00:47:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:47:29,694 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-02-17 00:47:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 00:47:29,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 24 [2023-02-17 00:47:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:47:29,696 INFO L225 Difference]: With dead ends: 31 [2023-02-17 00:47:29,696 INFO L226 Difference]: Without dead ends: 28 [2023-02-17 00:47:29,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-02-17 00:47:29,697 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:47:29,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 66 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:47:29,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-17 00:47:29,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-17 00:47:29,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2023-02-17 00:47:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-02-17 00:47:29,704 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2023-02-17 00:47:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:47:29,704 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-02-17 00:47:29,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) [2023-02-17 00:47:29,705 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-02-17 00:47:29,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 00:47:29,705 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:47:29,705 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:47:29,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 00:47:29,705 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:47:29,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:47:29,706 INFO L85 PathProgramCache]: Analyzing trace with hash 640634787, now seen corresponding path program 1 times [2023-02-17 00:47:29,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:47:29,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521223931] [2023-02-17 00:47:29,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:47:29,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:47:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:47:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:47:30,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:47:30,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521223931] [2023-02-17 00:47:30,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521223931] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:47:30,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767232409] [2023-02-17 00:47:30,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:47:30,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:47:30,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:47:30,521 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) [2023-02-17 00:47:30,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 00:47:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:47:30,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 104 conjunts are in the unsatisfiable core [2023-02-17 00:47:30,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:47:30,664 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:47:30,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:47:30,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 00:47:30,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:47:30,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 89 [2023-02-17 00:47:30,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:30,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:30,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-17 00:47:30,844 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-17 00:47:31,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:47:31,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 102 treesize of output 170 [2023-02-17 00:47:31,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,125 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-17 00:47:31,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,130 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 32 [2023-02-17 00:47:31,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-17 00:47:31,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-02-17 00:47:31,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2023-02-17 00:47:31,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-17 00:47:31,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:47:31,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 108 [2023-02-17 00:47:31,239 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:47:31,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2023-02-17 00:47:31,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2023-02-17 00:47:31,259 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:47:31,262 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 1 [2023-02-17 00:47:31,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,331 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 23 [2023-02-17 00:47:31,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,335 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 56 treesize of output 39 [2023-02-17 00:47:31,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-17 00:47:31,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:47:31,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 73 [2023-02-17 00:47:31,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:47:31,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2023-02-17 00:47:31,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 00:47:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:47:31,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:47:31,633 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2023-02-17 00:47:31,640 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_564))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_561))) (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_562)) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2023-02-17 00:47:31,670 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse2 .cse1 v_ArrVal_564))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_561))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_556))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_ArrVal_562))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2023-02-17 00:47:31,746 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_562 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_551 .cse10 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_552 .cse10 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse2 .cse1 v_ArrVal_564))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_561))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_556))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_ArrVal_562))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2023-02-17 00:47:31,798 INFO L350 Elim1Store]: Elim1 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 22616 treesize of output 21352 [2023-02-17 00:47:31,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:47:31,830 INFO L350 Elim1Store]: Elim1 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 24424 treesize of output 22994 [2023-02-17 00:47:31,878 INFO L350 Elim1Store]: Elim1 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 27368 treesize of output 26416 [2023-02-17 00:47:31,973 INFO L350 Elim1Store]: Elim1 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 2038938 treesize of output 1953336 [2023-02-17 00:47:32,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:47:32,173 INFO L350 Elim1Store]: Elim1 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 2210576 treesize of output 2104776 [2023-02-17 00:47:32,398 INFO L350 Elim1Store]: Elim1 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 2776674 treesize of output 2704530 [2023-02-17 00:47:32,660 INFO L350 Elim1Store]: Elim1 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 3167218 treesize of output 3068274 [2023-02-17 00:47:32,920 INFO L350 Elim1Store]: Elim1 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 3530034 treesize of output 3423234