./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e 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/heap-manipulation/dll_of_dll-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 13:40:40,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 13:40:40,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 13:40:40,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 13:40:40,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 13:40:40,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 13:40:40,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 13:40:40,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 13:40:40,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 13:40:40,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 13:40:40,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 13:40:40,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 13:40:40,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 13:40:40,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 13:40:40,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 13:40:40,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 13:40:40,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 13:40:40,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 13:40:40,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 13:40:40,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 13:40:40,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 13:40:40,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 13:40:40,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 13:40:40,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 13:40:40,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 13:40:40,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 13:40:40,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 13:40:40,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 13:40:40,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 13:40:40,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 13:40:40,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 13:40:40,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 13:40:40,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 13:40:40,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 13:40:40,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 13:40:40,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 13:40:40,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 13:40:40,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 13:40:40,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 13:40:40,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 13:40:40,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 13:40:40,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 13:40:40,110 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 13:40:40,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 13:40:40,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 13:40:40,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 13:40:40,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 13:40:40,112 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 13:40:40,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 13:40:40,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 13:40:40,112 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 13:40:40,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 13:40:40,113 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 13:40:40,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 13:40:40,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 13:40:40,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 13:40:40,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 13:40:40,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 13:40:40,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 13:40:40,113 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 13:40:40,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 13:40:40,114 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 13:40:40,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 13:40:40,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 13:40:40,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 13:40:40,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 13:40:40,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 13:40:40,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 13:40:40,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 13:40:40,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 13:40:40,115 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 13:40:40,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 13:40:40,115 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 13:40:40,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 13:40:40,115 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 13:40:40,116 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 13:40:40,116 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 13:40:40,116 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 -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2023-02-18 13:40:40,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 13:40:40,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 13:40:40,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 13:40:40,338 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 13:40:40,338 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 13:40:40,339 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2023-02-18 13:40:41,244 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 13:40:41,429 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 13:40:41,430 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2023-02-18 13:40:41,438 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0691639/baeb7257294a45cd8b6d18bde63c71e8/FLAGa956caf54 [2023-02-18 13:40:41,448 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0691639/baeb7257294a45cd8b6d18bde63c71e8 [2023-02-18 13:40:41,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 13:40:41,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 13:40:41,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 13:40:41,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 13:40:41,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 13:40:41,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b7e1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41, skipping insertion in model container [2023-02-18 13:40:41,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 13:40:41,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 13:40:41,657 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/heap-manipulation/dll_of_dll-2.i[22634,22647] [2023-02-18 13:40:41,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 13:40:41,687 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 13:40:41,704 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/heap-manipulation/dll_of_dll-2.i[22634,22647] [2023-02-18 13:40:41,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 13:40:41,733 INFO L208 MainTranslator]: Completed translation [2023-02-18 13:40:41,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41 WrapperNode [2023-02-18 13:40:41,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 13:40:41,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 13:40:41,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 13:40:41,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 13:40:41,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,765 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 228 [2023-02-18 13:40:41,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 13:40:41,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 13:40:41,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 13:40:41,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 13:40:41,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,794 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 13:40:41,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 13:40:41,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 13:40:41,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 13:40:41,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41" (1/1) ... [2023-02-18 13:40:41,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 13:40:41,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 13:40:41,846 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-18 13:40:41,853 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-18 13:40:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-18 13:40:41,874 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-18 13:40:41,875 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2023-02-18 13:40:41,875 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2023-02-18 13:40:41,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 13:40:41,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 13:40:41,876 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2023-02-18 13:40:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2023-02-18 13:40:41,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-18 13:40:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 13:40:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-02-18 13:40:41,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-02-18 13:40:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 13:40:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 13:40:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-18 13:40:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2023-02-18 13:40:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2023-02-18 13:40:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2023-02-18 13:40:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2023-02-18 13:40:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 13:40:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 13:40:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 13:40:42,016 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 13:40:42,017 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 13:40:42,295 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 13:40:42,299 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 13:40:42,300 INFO L300 CfgBuilder]: Removed 38 assume(true) statements. [2023-02-18 13:40:42,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:40:42 BoogieIcfgContainer [2023-02-18 13:40:42,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 13:40:42,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 13:40:42,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 13:40:42,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 13:40:42,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:40:41" (1/3) ... [2023-02-18 13:40:42,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b9a132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:40:42, skipping insertion in model container [2023-02-18 13:40:42,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:40:41" (2/3) ... [2023-02-18 13:40:42,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b9a132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:40:42, skipping insertion in model container [2023-02-18 13:40:42,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:40:42" (3/3) ... [2023-02-18 13:40:42,311 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2023-02-18 13:40:42,322 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 13:40:42,322 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 13:40:42,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 13:40:42,363 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;@48a5bd3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 13:40:42,363 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 13:40:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 96 states have (on average 1.7083333333333333) internal successors, (164), 116 states have internal predecessors, (164), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-02-18 13:40:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-18 13:40:42,372 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:40:42,372 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:40:42,373 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:40:42,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:40:42,377 INFO L85 PathProgramCache]: Analyzing trace with hash 760908611, now seen corresponding path program 1 times [2023-02-18 13:40:42,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 13:40:42,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877386811] [2023-02-18 13:40:42,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 13:40:42,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 13:40:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:42,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 13:40:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:42,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-18 13:40:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:42,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 13:40:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 13:40:42,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 13:40:42,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877386811] [2023-02-18 13:40:42,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877386811] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 13:40:42,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 13:40:42,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 13:40:42,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090220041] [2023-02-18 13:40:42,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 13:40:42,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 13:40:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 13:40:42,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 13:40:42,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 13:40:42,709 INFO L87 Difference]: Start difference. First operand has 128 states, 96 states have (on average 1.7083333333333333) internal successors, (164), 116 states have internal predecessors, (164), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 13:40:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:40:42,897 INFO L93 Difference]: Finished difference Result 251 states and 429 transitions. [2023-02-18 13:40:42,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 13:40:42,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2023-02-18 13:40:42,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:40:42,907 INFO L225 Difference]: With dead ends: 251 [2023-02-18 13:40:42,907 INFO L226 Difference]: Without dead ends: 120 [2023-02-18 13:40:42,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-18 13:40:42,915 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 38 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 13:40:42,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 181 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 13:40:42,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-18 13:40:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-02-18 13:40:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 108 states have internal predecessors, (115), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 13:40:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2023-02-18 13:40:42,954 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 37 [2023-02-18 13:40:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:40:42,954 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2023-02-18 13:40:42,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 13:40:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2023-02-18 13:40:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 13:40:42,956 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:40:42,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:40:42,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 13:40:42,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:40:42,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:40:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1675514385, now seen corresponding path program 1 times [2023-02-18 13:40:42,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 13:40:42,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47233876] [2023-02-18 13:40:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 13:40:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 13:40:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:43,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 13:40:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:43,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-18 13:40:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:43,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 13:40:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 13:40:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 13:40:43,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47233876] [2023-02-18 13:40:43,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47233876] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 13:40:43,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090402248] [2023-02-18 13:40:43,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 13:40:43,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 13:40:43,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 13:40:43,417 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-18 13:40:43,436 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-18 13:40:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:43,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 13:40:43,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:40:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 13:40:43,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:40:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 13:40:43,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090402248] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:40:43,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 13:40:43,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 12 [2023-02-18 13:40:43,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213489485] [2023-02-18 13:40:43,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 13:40:43,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 13:40:43,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 13:40:43,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 13:40:43,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-18 13:40:43,694 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 12 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 13:40:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:40:44,047 INFO L93 Difference]: Finished difference Result 250 states and 324 transitions. [2023-02-18 13:40:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 13:40:44,047 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2023-02-18 13:40:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:40:44,049 INFO L225 Difference]: With dead ends: 250 [2023-02-18 13:40:44,049 INFO L226 Difference]: Without dead ends: 133 [2023-02-18 13:40:44,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-02-18 13:40:44,050 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 52 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 13:40:44,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1037 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 13:40:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-18 13:40:44,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-02-18 13:40:44,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 116 states have internal predecessors, (124), 27 states have call successors, (27), 8 states have call predecessors, (27), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-18 13:40:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2023-02-18 13:40:44,061 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 38 [2023-02-18 13:40:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:40:44,062 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2023-02-18 13:40:44,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 13:40:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2023-02-18 13:40:44,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-02-18 13:40:44,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:40:44,064 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:40:44,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 13:40:44,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 13:40:44,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:40:44,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:40:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 800158065, now seen corresponding path program 1 times [2023-02-18 13:40:44,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 13:40:44,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198897748] [2023-02-18 13:40:44,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 13:40:44,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 13:40:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:44,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 13:40:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-18 13:40:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 13:40:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:45,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-18 13:40:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:45,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-18 13:40:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:45,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-18 13:40:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:45,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 13:40:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-18 13:40:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:45,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 13:40:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:46,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-18 13:40:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:46,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-18 13:40:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:46,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-18 13:40:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:46,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 13:40:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-18 13:40:46,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 13:40:46,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198897748] [2023-02-18 13:40:46,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198897748] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 13:40:46,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791974470] [2023-02-18 13:40:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 13:40:46,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 13:40:46,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 13:40:46,182 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-18 13:40:46,184 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-18 13:40:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:46,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-18 13:40:46,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:40:46,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 13:40:46,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 100 [2023-02-18 13:40:46,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-02-18 13:40:46,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-02-18 13:40:46,547 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 13:40:46,548 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 94 treesize of output 27 [2023-02-18 13:40:46,552 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:46,597 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_dll_insert_master_#in~dll#1.base|))) (let ((.cse4 (select .cse3 |c_dll_insert_master_#in~dll#1.offset|))) (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse0 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse1)) (.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (and (= v_DerPreprocessor_2 .cse0) (not (= 0 .cse1)) (= .cse2 .cse3) (not (= .cse1 |c_dll_insert_master_#in~dll#1.base|)) (not (= |c_dll_insert_master_#in~dll#1.base| .cse1)) (= .cse4 .cse1) (= .cse0 .cse2))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse5 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse6))) (and (= v_DerPreprocessor_2 .cse5) (not (= 0 .cse6)) (not (= .cse6 |c_dll_insert_master_#in~dll#1.base|)) (not (= |c_dll_insert_master_#in~dll#1.base| .cse6)) (= .cse4 .cse6) (= .cse5 v_DerPreprocessor_3) (= .cse5 (select |c_#memory_$Pointer$.base| .cse6)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse8 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse7 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse7))) (and (= .cse7 |c_dll_insert_master_#in~dll#1.base|) (= v_DerPreprocessor_2 .cse8) (not (= 0 .cse7)) (= (select |c_#memory_$Pointer$.base| .cse7) .cse3) (not (= |c_dll_insert_master_#in~dll#1.base| .cse7)) (= .cse4 .cse7) (= .cse8 v_DerPreprocessor_3))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse9 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse10))) (and (= v_DerPreprocessor_2 .cse9) (not (= 0 .cse10)) (not (= .cse10 |c_dll_insert_master_#in~dll#1.base|)) (not (= |c_dll_insert_master_#in~dll#1.base| .cse10)) (= .cse4 .cse10) (= .cse9 (select |c_#memory_$Pointer$.base| .cse10)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse12 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse12)) (.cse13 (select |c_#memory_$Pointer$.base| .cse12))) (and (= v_DerPreprocessor_2 .cse11) (not (= 0 .cse12)) (= .cse13 .cse3) (not (= |c_dll_insert_master_#in~dll#1.base| .cse12)) (= .cse4 .cse12) (= .cse11 v_DerPreprocessor_3) (= .cse11 .cse13))))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse4))) (and (= (select .cse14 |c_dll_insert_master_#in~dll#1.offset|) .cse4) (= |c_dll_insert_master_#in~dll#1.base| .cse4) (or (not (= .cse4 |c_dll_insert_master_#in~dll#1.base|)) (= .cse14 .cse3)) (not (= 0 .cse4))))))) is different from true [2023-02-18 13:40:46,651 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|))) (let ((.cse0 (select .cse2 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (or (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0))) (and (or (not (= .cse0 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|)) (= .cse1 .cse2)) (= (select .cse1 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) .cse0) (not (= 0 .cse0)) (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse0))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse4 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse3))) (and (not (= 0 .cse3)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse3)) (not (= .cse3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|)) (= .cse4 (select |c_#memory_$Pointer$.base| .cse3)) (= .cse0 .cse3) (= v_DerPreprocessor_2 .cse4))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse6)) (.cse7 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse6))) (and (= .cse5 .cse2) (not (= 0 .cse6)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse6)) (= .cse7 .cse5) (= .cse0 .cse6) (= v_DerPreprocessor_2 .cse7) (= .cse7 v_DerPreprocessor_3))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse9 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse8))) (and (not (= 0 .cse8)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse8)) (not (= .cse8 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|)) (= .cse9 (select |c_#memory_$Pointer$.base| .cse8)) (= .cse0 .cse8) (= v_DerPreprocessor_2 .cse9) (= .cse9 v_DerPreprocessor_3))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse10))) (and (= (select |c_#memory_$Pointer$.base| .cse10) .cse2) (not (= 0 .cse10)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse10)) (= .cse0 .cse10) (= v_DerPreprocessor_2 .cse11) (= .cse10 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) (= .cse11 v_DerPreprocessor_3))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse13)) (.cse14 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse13))) (and (= .cse12 .cse2) (not (= 0 .cse13)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse13)) (not (= .cse13 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|)) (= .cse14 .cse12) (= .cse0 .cse13) (= v_DerPreprocessor_2 .cse14)))))))) is different from true [2023-02-18 13:40:46,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 13:40:46,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 460 treesize of output 609 [2023-02-18 13:40:46,849 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 415 treesize of output 395 [2023-02-18 13:40:47,103 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 59 treesize of output 49 [2023-02-18 13:40:47,119 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 59 treesize of output 49 [2023-02-18 13:40:47,135 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,201 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,208 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 59 treesize of output 49 [2023-02-18 13:40:47,227 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,234 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,240 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 496 treesize of output 480 [2023-02-18 13:40:47,383 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 15 treesize of output 11 [2023-02-18 13:40:47,387 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,391 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 46 treesize of output 34 [2023-02-18 13:40:47,394 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 35 treesize of output 27 [2023-02-18 13:40:47,397 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 35 treesize of output 27 [2023-02-18 13:40:47,400 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,403 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,406 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 35 treesize of output 27 [2023-02-18 13:40:47,410 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,414 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,417 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,420 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,424 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,427 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 46 treesize of output 34 [2023-02-18 13:40:47,432 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,435 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,438 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,442 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,444 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,448 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 34 treesize of output 24 [2023-02-18 13:40:47,452 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,455 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,458 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,463 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,466 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,478 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 46 treesize of output 34 [2023-02-18 13:40:47,482 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,486 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,489 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,492 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,495 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,498 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,502 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,507 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 46 treesize of output 34 [2023-02-18 13:40:47,510 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,514 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,517 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,520 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,523 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,527 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,530 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,536 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,540 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,545 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,549 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,554 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,558 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,562 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,567 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 48 treesize of output 36 [2023-02-18 13:40:47,571 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,575 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,579 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,582 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,586 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,591 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 48 treesize of output 36 [2023-02-18 13:40:47,595 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,599 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,603 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,607 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,611 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 13:40:47,613 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 346 treesize of output 330 [2023-02-18 13:40:47,652 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 14 treesize of output 10 [2023-02-18 13:40:47,654 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 12 treesize of output 8 [2023-02-18 13:40:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-02-18 13:40:47,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:40:47,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 13:40:47,715 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2023-02-18 13:40:47,717 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 120 treesize of output 116 [2023-02-18 13:40:47,719 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 116 treesize of output 114 [2023-02-18 13:40:47,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 13:40:47,725 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-18 13:40:47,727 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 6 treesize of output 4 [2023-02-18 13:40:47,730 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 20 treesize of output 18 [2023-02-18 13:40:47,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 13:40:47,733 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-18 13:40:47,735 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-18 13:40:47,736 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 13:40:47,737 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-18 13:40:47,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 13:40:47,751 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2023-02-18 13:40:47,753 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 120 treesize of output 116 [2023-02-18 13:40:47,755 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 116 treesize of output 114 [2023-02-18 13:40:47,758 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 13:40:47,759 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-18 13:40:47,762 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 20 treesize of output 18 [2023-02-18 13:40:47,764 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 6 treesize of output 4 [2023-02-18 13:40:47,766 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 13:40:47,767 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-18 13:40:47,768 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 13:40:47,769 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-18 13:40:47,771 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-18 13:40:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-02-18 13:40:47,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791974470] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:40:47,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 13:40:47,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 15] total 29 [2023-02-18 13:40:47,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474472820] [2023-02-18 13:40:47,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 13:40:47,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-18 13:40:47,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 13:40:47,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-18 13:40:47,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=645, Unknown=3, NotChecked=102, Total=812 [2023-02-18 13:40:47,799 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 29 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (22), 4 states have call predecessors, (22), 9 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2023-02-18 13:40:48,403 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_dll_create_generic_~#dll~0.base|))) (let ((.cse0 (select .cse4 |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse12 (not (= 0 .cse0)))) (and (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_3 |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse2 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse1))) (and (= .cse0 .cse1) (not (= 0 .cse1)) (= .cse2 (select |c_#memory_$Pointer$.base| .cse1)) (not (= .cse1 |c_dll_create_generic_~#dll~0.base|)) (= v_DerPreprocessor_2 .cse2) (not (= |c_dll_create_generic_~#dll~0.base| .cse1)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_3 |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse5 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse3))) (and (= .cse0 .cse3) (= .cse3 |c_dll_create_generic_~#dll~0.base|) (not (= 0 .cse3)) (= (select |c_#memory_$Pointer$.base| .cse3) .cse4) (= v_DerPreprocessor_2 .cse5) (= .cse5 v_DerPreprocessor_3) (not (= |c_dll_create_generic_~#dll~0.base| .cse3)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_3 |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse7 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse6))) (and (= .cse0 .cse6) (not (= 0 .cse6)) (= .cse7 (select |c_#memory_$Pointer$.base| .cse6)) (not (= .cse6 |c_dll_create_generic_~#dll~0.base|)) (= v_DerPreprocessor_2 .cse7) (= .cse7 v_DerPreprocessor_3) (not (= |c_dll_create_generic_~#dll~0.base| .cse6)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_3 |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8)) (.cse10 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse8))) (and (= .cse0 .cse8) (not (= 0 .cse8)) (= .cse9 .cse4) (= .cse10 .cse9) (not (= .cse8 |c_dll_create_generic_~#dll~0.base|)) (= v_DerPreprocessor_2 .cse10) (not (= |c_dll_create_generic_~#dll~0.base| .cse8)))))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse0))) (and (or (= .cse11 .cse4) (not (= .cse0 |c_dll_create_generic_~#dll~0.base|))) (= (select .cse11 |c_dll_create_generic_~#dll~0.offset|) .cse0) .cse12 (= |c_dll_create_generic_~#dll~0.base| .cse0))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_3 |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse13)) (.cse15 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse13))) (and (= .cse0 .cse13) (not (= 0 .cse13)) (= .cse14 .cse4) (= .cse15 .cse14) (= v_DerPreprocessor_2 .cse15) (= .cse15 v_DerPreprocessor_3) (not (= |c_dll_create_generic_~#dll~0.base| .cse13))))))) (= 0 |c_dll_create_generic_~#dll~0.offset|) .cse12 (<= |c_#StackHeapBarrier| (+ |c_dll_create_generic_~#dll~0.base| (- 1))))))) is different from true [2023-02-18 13:40:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:40:49,024 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2023-02-18 13:40:49,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-18 13:40:49,025 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (22), 4 states have call predecessors, (22), 9 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) Word has length 110 [2023-02-18 13:40:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:40:49,026 INFO L225 Difference]: With dead ends: 334 [2023-02-18 13:40:49,026 INFO L226 Difference]: Without dead ends: 205 [2023-02-18 13:40:49,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 234 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=1982, Unknown=8, NotChecked=276, Total=2450 [2023-02-18 13:40:49,027 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 273 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 61 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 481 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-18 13:40:49,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1761 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1798 Invalid, 9 Unknown, 481 Unchecked, 0.9s Time] [2023-02-18 13:40:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-18 13:40:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 165. [2023-02-18 13:40:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.253968253968254) internal successors, (158), 143 states have internal predecessors, (158), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (17), 13 states have call predecessors, (17), 14 states have call successors, (17) [2023-02-18 13:40:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 203 transitions. [2023-02-18 13:40:49,039 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 203 transitions. Word has length 110 [2023-02-18 13:40:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:40:49,040 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 203 transitions. [2023-02-18 13:40:49,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (22), 4 states have call predecessors, (22), 9 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2023-02-18 13:40:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 203 transitions. [2023-02-18 13:40:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-18 13:40:49,041 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:40:49,041 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:40:49,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 13:40:49,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-02-18 13:40:49,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:40:49,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:40:49,249 INFO L85 PathProgramCache]: Analyzing trace with hash 614553281, now seen corresponding path program 1 times [2023-02-18 13:40:49,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 13:40:49,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510193116] [2023-02-18 13:40:49,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 13:40:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 13:40:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:49,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 13:40:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:50,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-18 13:40:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:50,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 13:40:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-18 13:40:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:50,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-18 13:40:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:50,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-18 13:40:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:50,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 13:40:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:51,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-18 13:40:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:51,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 13:40:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:51,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-18 13:40:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:51,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-18 13:40:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:51,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-18 13:40:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:51,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 13:40:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 7 proven. 87 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-02-18 13:40:51,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 13:40:51,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510193116] [2023-02-18 13:40:51,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510193116] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 13:40:51,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419918919] [2023-02-18 13:40:51,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 13:40:51,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 13:40:51,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 13:40:51,202 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 13:40:51,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 13:40:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:40:51,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-18 13:40:51,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:40:51,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-18 13:40:51,566 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 8 treesize of output 4 [2023-02-18 13:40:51,648 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2702 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int)) (and (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base| (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2702) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-18 13:40:51,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 13:40:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 80 proven. 7 refuted. 0 times theorem prover too weak. 46 trivial. 1 not checked. [2023-02-18 13:40:51,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:40:51,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419918919] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 13:40:51,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:40:51,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 31 [2023-02-18 13:40:51,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134358370] [2023-02-18 13:40:51,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:40:51,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-18 13:40:51,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 13:40:51,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-18 13:40:51,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=828, Unknown=22, NotChecked=58, Total=992 [2023-02-18 13:40:51,839 INFO L87 Difference]: Start difference. First operand 165 states and 203 transitions. Second operand has 31 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 27 states have internal predecessors, (87), 10 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (20), 6 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-18 13:40:55,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 13:40:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:40:57,459 INFO L93 Difference]: Finished difference Result 343 states and 429 transitions. [2023-02-18 13:40:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-18 13:40:57,460 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 27 states have internal predecessors, (87), 10 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (20), 6 states have call predecessors, (20), 10 states have call successors, (20) Word has length 113 [2023-02-18 13:40:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:40:57,461 INFO L225 Difference]: With dead ends: 343 [2023-02-18 13:40:57,461 INFO L226 Difference]: Without dead ends: 179 [2023-02-18 13:40:57,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 159 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=318, Invalid=2622, Unknown=34, NotChecked=106, Total=3080 [2023-02-18 13:40:57,463 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 173 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 38 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-18 13:40:57,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1588 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1963 Invalid, 14 Unknown, 173 Unchecked, 3.2s Time] [2023-02-18 13:40:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-18 13:40:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2023-02-18 13:40:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 136 states have (on average 1.2352941176470589) internal successors, (168), 154 states have internal predecessors, (168), 29 states have call successors, (29), 11 states have call predecessors, (29), 12 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2023-02-18 13:40:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 214 transitions. [2023-02-18 13:40:57,479 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 214 transitions. Word has length 113 [2023-02-18 13:40:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:40:57,479 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 214 transitions. [2023-02-18 13:40:57,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 27 states have internal predecessors, (87), 10 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (20), 6 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-18 13:40:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 214 transitions. [2023-02-18 13:40:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-18 13:40:57,486 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:40:57,486 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:40:57,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 13:40:57,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 13:40:57,695 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:40:57,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:40:57,695 INFO L85 PathProgramCache]: Analyzing trace with hash 522299907, now seen corresponding path program 1 times [2023-02-18 13:40:57,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 13:40:57,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896467068] [2023-02-18 13:40:57,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 13:40:57,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 13:40:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:41:00,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 13:41:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:41:02,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-18 13:41:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:41:02,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 13:41:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:41:02,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-18 13:41:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:41:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-18 13:41:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:41:02,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-18 13:41:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:41:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 13:41:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:41:02,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-18 13:41:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:41:03,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 13:41:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:41:04,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-18 13:41:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:41:05,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-18 13:41:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat