./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c4f91361 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.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 --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 a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-c4f9136-m [2023-11-23 14:56:27,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 14:56:27,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 14:56:27,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 14:56:27,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 14:56:27,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 14:56:27,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 14:56:27,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 14:56:27,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 14:56:27,120 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 14:56:27,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 14:56:27,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 14:56:27,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 14:56:27,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 14:56:27,123 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 14:56:27,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 14:56:27,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 14:56:27,124 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 14:56:27,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 14:56:27,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 14:56:27,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 14:56:27,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 14:56:27,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 14:56:27,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 14:56:27,125 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 14:56:27,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 14:56:27,126 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 14:56:27,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 14:56:27,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 14:56:27,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 14:56:27,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 14:56:27,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 14:56:27,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 14:56:27,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 14:56:27,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 14:56:27,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 14:56:27,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 14:56:27,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 14:56:27,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 14:56:27,129 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 14:56:27,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 14:56:27,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 14:56:27,130 INFO L153 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 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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2023-11-23 14:56:27,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 14:56:27,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 14:56:27,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 14:56:27,366 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 14:56:27,366 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 14:56:27,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i [2023-11-23 14:56:28,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 14:56:28,547 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 14:56:28,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i [2023-11-23 14:56:28,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be39240d/1118cf4f777a4cff872bed46c598636b/FLAG68b3b2a82 [2023-11-23 14:56:28,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be39240d/1118cf4f777a4cff872bed46c598636b [2023-11-23 14:56:28,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 14:56:28,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 14:56:28,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 14:56:28,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 14:56:28,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 14:56:28,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:28,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724a8341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28, skipping insertion in model container [2023-11-23 14:56:28,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:28,634 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 14:56:28,830 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2023-11-23 14:56:28,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 14:56:28,842 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 14:56:28,890 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2023-11-23 14:56:28,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 14:56:28,911 INFO L206 MainTranslator]: Completed translation [2023-11-23 14:56:28,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28 WrapperNode [2023-11-23 14:56:28,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 14:56:28,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 14:56:28,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 14:56:28,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 14:56:28,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:28,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:28,962 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 106 [2023-11-23 14:56:28,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 14:56:28,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 14:56:28,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 14:56:28,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 14:56:28,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:28,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:28,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:28,989 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2023-11-23 14:56:28,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:28,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:28,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:28,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:28,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:28,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:29,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 14:56:29,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 14:56:29,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 14:56:29,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 14:56:29,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (1/1) ... [2023-11-23 14:56:29,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 14:56:29,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:56:29,030 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-11-23 14:56:29,053 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-11-23 14:56:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 14:56:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 14:56:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 14:56:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-23 14:56:29,091 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-23 14:56:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 14:56:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 14:56:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 14:56:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 14:56:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 14:56:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 14:56:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 14:56:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 14:56:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 14:56:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 14:56:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 14:56:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 14:56:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 14:56:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 14:56:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 14:56:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 14:56:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 14:56:29,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 14:56:29,197 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 14:56:29,199 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 14:56:29,366 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 14:56:29,403 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 14:56:29,404 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 14:56:29,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:56:29 BoogieIcfgContainer [2023-11-23 14:56:29,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 14:56:29,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 14:56:29,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 14:56:29,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 14:56:29,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:56:28" (1/3) ... [2023-11-23 14:56:29,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3179a642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:56:29, skipping insertion in model container [2023-11-23 14:56:29,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:28" (2/3) ... [2023-11-23 14:56:29,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3179a642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:56:29, skipping insertion in model container [2023-11-23 14:56:29,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:56:29" (3/3) ... [2023-11-23 14:56:29,438 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2023-11-23 14:56:29,460 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 14:56:29,460 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 14:56:29,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 14:56:29,504 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=LoopHeads, 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;@3de2e747, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 14:56:29,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 14:56:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-23 14:56:29,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:29,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:29,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:29,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:29,519 INFO L85 PathProgramCache]: Analyzing trace with hash -433254446, now seen corresponding path program 1 times [2023-11-23 14:56:29,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:29,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911521114] [2023-11-23 14:56:29,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:29,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:29,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:56:29,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:29,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911521114] [2023-11-23 14:56:29,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911521114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:56:29,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:56:29,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 14:56:29,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954279486] [2023-11-23 14:56:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:56:29,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 14:56:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:29,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 14:56:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 14:56:29,893 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 14:56:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:29,937 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2023-11-23 14:56:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 14:56:29,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-23 14:56:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:29,944 INFO L225 Difference]: With dead ends: 32 [2023-11-23 14:56:29,944 INFO L226 Difference]: Without dead ends: 19 [2023-11-23 14:56:29,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-23 14:56:29,950 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:29,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-23 14:56:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-23 14:56:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-11-23 14:56:29,977 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2023-11-23 14:56:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:29,978 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-11-23 14:56:29,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 14:56:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-11-23 14:56:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-23 14:56:29,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:29,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:29,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 14:56:29,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:29,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:29,981 INFO L85 PathProgramCache]: Analyzing trace with hash -805433409, now seen corresponding path program 1 times [2023-11-23 14:56:29,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:29,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584917375] [2023-11-23 14:56:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:29,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:30,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:56:30,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:30,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584917375] [2023-11-23 14:56:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584917375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:56:30,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:56:30,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 14:56:30,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699145971] [2023-11-23 14:56:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:56:30,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 14:56:30,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:30,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 14:56:30,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 14:56:30,114 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 14:56:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:30,155 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2023-11-23 14:56:30,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 14:56:30,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-23 14:56:30,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:30,157 INFO L225 Difference]: With dead ends: 32 [2023-11-23 14:56:30,158 INFO L226 Difference]: Without dead ends: 24 [2023-11-23 14:56:30,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 14:56:30,159 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:30,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 38 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-23 14:56:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2023-11-23 14:56:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-23 14:56:30,165 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2023-11-23 14:56:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:30,166 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-23 14:56:30,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 14:56:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-23 14:56:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 14:56:30,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:30,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:30,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 14:56:30,167 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:30,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:30,168 INFO L85 PathProgramCache]: Analyzing trace with hash 476536632, now seen corresponding path program 1 times [2023-11-23 14:56:30,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:30,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732935791] [2023-11-23 14:56:30,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:30,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:30,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 14:56:30,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:30,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732935791] [2023-11-23 14:56:30,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732935791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:56:30,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:56:30,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 14:56:30,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753964713] [2023-11-23 14:56:30,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:56:30,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 14:56:30,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:30,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 14:56:30,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 14:56:30,320 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:30,354 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2023-11-23 14:56:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 14:56:30,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-11-23 14:56:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:30,355 INFO L225 Difference]: With dead ends: 27 [2023-11-23 14:56:30,355 INFO L226 Difference]: Without dead ends: 23 [2023-11-23 14:56:30,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 14:56:30,356 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:30,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-23 14:56:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-11-23 14:56:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-23 14:56:30,360 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 20 [2023-11-23 14:56:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:30,360 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-23 14:56:30,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-23 14:56:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 14:56:30,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:30,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:30,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 14:56:30,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:30,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1148802953, now seen corresponding path program 1 times [2023-11-23 14:56:30,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:30,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409518100] [2023-11-23 14:56:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:30,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:30,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:30,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 14:56:30,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:30,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409518100] [2023-11-23 14:56:30,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409518100] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:56:30,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902718841] [2023-11-23 14:56:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:30,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:30,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:56:30,549 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-11-23 14:56:30,580 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-11-23 14:56:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:30,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 14:56:30,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:56:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 14:56:30,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:56:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 14:56:30,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902718841] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:56:30,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 14:56:30,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-23 14:56:30,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309748029] [2023-11-23 14:56:30,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 14:56:30,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 14:56:30,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:30,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 14:56:30,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-23 14:56:30,808 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 14:56:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:30,856 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-11-23 14:56:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 14:56:30,857 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2023-11-23 14:56:30,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:30,857 INFO L225 Difference]: With dead ends: 28 [2023-11-23 14:56:30,857 INFO L226 Difference]: Without dead ends: 24 [2023-11-23 14:56:30,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-23 14:56:30,858 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:30,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-23 14:56:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-23 14:56:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-11-23 14:56:30,862 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 23 [2023-11-23 14:56:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:30,862 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-11-23 14:56:30,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 14:56:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-11-23 14:56:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 14:56:30,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:30,863 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:30,878 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-11-23 14:56:31,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:31,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:31,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:31,077 INFO L85 PathProgramCache]: Analyzing trace with hash -179084584, now seen corresponding path program 2 times [2023-11-23 14:56:31,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:31,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901865831] [2023-11-23 14:56:31,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:31,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:31,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 14:56:31,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:31,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901865831] [2023-11-23 14:56:31,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901865831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:56:31,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:56:31,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 14:56:31,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816375912] [2023-11-23 14:56:31,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:56:31,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 14:56:31,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:31,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 14:56:31,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 14:56:31,269 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:31,334 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-11-23 14:56:31,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 14:56:31,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-11-23 14:56:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:31,335 INFO L225 Difference]: With dead ends: 33 [2023-11-23 14:56:31,336 INFO L226 Difference]: Without dead ends: 24 [2023-11-23 14:56:31,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 14:56:31,336 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:31,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-23 14:56:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-23 14:56:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-11-23 14:56:31,340 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 26 [2023-11-23 14:56:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:31,340 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-11-23 14:56:31,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-11-23 14:56:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 14:56:31,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:31,341 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:31,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 14:56:31,341 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:31,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash 558232088, now seen corresponding path program 1 times [2023-11-23 14:56:31,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:31,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420509606] [2023-11-23 14:56:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:32,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:32,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 14:56:32,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:32,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420509606] [2023-11-23 14:56:32,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420509606] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:56:32,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254943597] [2023-11-23 14:56:32,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:32,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:32,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:56:32,627 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-11-23 14:56:32,654 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-11-23 14:56:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:33,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-23 14:56:33,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:56:33,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 14:56:33,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-23 14:56:33,298 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 14:56:33,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2023-11-23 14:56:33,317 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 14:56:33,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 14:56:33,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-23 14:56:33,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-23 14:56:33,449 INFO L378 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-11-23 14:56:33,576 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 14:56:33,577 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 70 [2023-11-23 14:56:33,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 45 [2023-11-23 14:56:33,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 70 [2023-11-23 14:56:33,794 INFO L349 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-11-23 14:56:33,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 211 treesize of output 86 [2023-11-23 14:56:33,928 INFO L378 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 94 treesize of output 54 [2023-11-23 14:56:33,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-23 14:56:33,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-23 14:56:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:56:33,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:56:34,238 INFO L378 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 1488 treesize of output 1360 [2023-11-23 14:56:34,244 INFO L378 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 980 treesize of output 864 [2023-11-23 14:56:34,689 INFO L378 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 331 treesize of output 313 [2023-11-23 14:56:34,707 INFO L378 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 1808 treesize of output 1802 [2023-11-23 14:56:34,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254943597] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:56:34,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:56:34,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2023-11-23 14:56:34,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741992579] [2023-11-23 14:56:34,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 14:56:34,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 14:56:34,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:34,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 14:56:34,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1407, Unknown=0, NotChecked=0, Total=1560 [2023-11-23 14:56:34,901 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 14:56:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:35,372 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2023-11-23 14:56:35,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 14:56:35,373 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-11-23 14:56:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:35,374 INFO L225 Difference]: With dead ends: 44 [2023-11-23 14:56:35,375 INFO L226 Difference]: Without dead ends: 31 [2023-11-23 14:56:35,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=199, Invalid=1781, Unknown=0, NotChecked=0, Total=1980 [2023-11-23 14:56:35,376 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:35,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 151 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 14:56:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-23 14:56:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-23 14:56:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:56:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-23 14:56:35,381 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 26 [2023-11-23 14:56:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:35,381 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-23 14:56:35,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 14:56:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-23 14:56:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 14:56:35,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:35,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:35,395 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-11-23 14:56:35,595 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,SelfDestructingSolverStorable5 [2023-11-23 14:56:35,595 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:35,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:35,596 INFO L85 PathProgramCache]: Analyzing trace with hash -452885162, now seen corresponding path program 1 times [2023-11-23 14:56:35,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:35,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039302376] [2023-11-23 14:56:35,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:35,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:35,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:35,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 14:56:35,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:35,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039302376] [2023-11-23 14:56:35,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039302376] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:56:35,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627443828] [2023-11-23 14:56:35,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:35,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:35,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:56:35,706 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-11-23 14:56:35,731 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-11-23 14:56:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:35,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 14:56:35,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:56:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 14:56:35,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:56:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 14:56:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627443828] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:56:35,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 14:56:35,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-23 14:56:35,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898181293] [2023-11-23 14:56:35,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 14:56:35,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 14:56:35,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:35,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 14:56:35,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 14:56:35,891 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:35,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:35,935 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2023-11-23 14:56:35,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 14:56:35,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-11-23 14:56:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:35,936 INFO L225 Difference]: With dead ends: 49 [2023-11-23 14:56:35,936 INFO L226 Difference]: Without dead ends: 29 [2023-11-23 14:56:35,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 14:56:35,938 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:35,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 77 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-23 14:56:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-23 14:56:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:56:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-11-23 14:56:35,949 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2023-11-23 14:56:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:35,950 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-11-23 14:56:35,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-11-23 14:56:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-23 14:56:35,953 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:35,953 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:35,978 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-11-23 14:56:36,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:36,165 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:36,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash 812530129, now seen corresponding path program 2 times [2023-11-23 14:56:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464774266] [2023-11-23 14:56:36,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:36,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:36,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:36,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 14:56:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 14:56:36,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464774266] [2023-11-23 14:56:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464774266] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:56:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577305463] [2023-11-23 14:56:36,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 14:56:36,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:36,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:56:36,277 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:56:36,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 14:56:36,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 14:56:36,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 14:56:36,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 14:56:36,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:56:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 14:56:36,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 14:56:36,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577305463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:56:36,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 14:56:36,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-23 14:56:36,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598614242] [2023-11-23 14:56:36,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:56:36,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 14:56:36,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:36,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 14:56:36,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 14:56:36,497 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 14:56:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:36,511 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-11-23 14:56:36,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 14:56:36,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-11-23 14:56:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:36,513 INFO L225 Difference]: With dead ends: 32 [2023-11-23 14:56:36,513 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 14:56:36,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 14:56:36,514 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:36,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 14:56:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 14:56:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:56:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 14:56:36,515 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2023-11-23 14:56:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:36,515 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 14:56:36,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 14:56:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 14:56:36,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 14:56:36,518 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 14:56:36,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 14:56:36,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:36,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 14:56:36,915 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 612) no Hoare annotation was computed. [2023-11-23 14:56:36,915 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 2) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse0 4) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select .cse0 0) 0))) [2023-11-23 14:56:36,915 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-11-23 14:56:36,915 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 613 627) no Hoare annotation was computed. [2023-11-23 14:56:36,916 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 620) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse2 0))) (let ((.cse5 (select |#memory_$Pointer$#2.offset| .cse9)) (.cse13 (select (select |#memory_$Pointer$#2.base| .cse9) 4)) (.cse1 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (= (select .cse1 0) 0)) (.cse3 (= .cse9 .cse13)) (.cse6 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= (select .cse5 4) 0))) (or (and .cse0 (= (select .cse1 |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse2 |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (and .cse3 .cse4 (= (select .cse5 0) 0) .cse6 .cse0 .cse7 (<= |ULTIMATE.start_main_~i~0#1| 1) (exists ((v_arrayElimCell_14 Int)) (let ((.cse8 (select |#memory_$Pointer$#2.offset| v_arrayElimCell_14)) (.cse10 (select |#memory_$Pointer$#2.base| v_arrayElimCell_14))) (and (= (select .cse8 0) 0) (not (= .cse9 v_arrayElimCell_14)) (= .cse9 (select .cse10 4)) (= (select .cse8 4) 0) (= .cse9 (select .cse10 0)))))) (let ((.cse12 (select |#memory_$Pointer$#2.offset| .cse13)) (.cse11 (select |#memory_$Pointer$#2.base| .cse13))) (and .cse4 (= |ULTIMATE.start_main_~i~0#1| 0) (not .cse3) (= .cse9 (select .cse11 0)) (= (select .cse12 0) 0) .cse6 (= (select .cse12 4) 0) .cse0 .cse7 (= .cse9 (select .cse11 4))))))))) [2023-11-23 14:56:36,916 INFO L899 garLoopResultBuilder]: For program point L618-4(lines 618 620) no Hoare annotation was computed. [2023-11-23 14:56:36,916 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 625) no Hoare annotation was computed. [2023-11-23 14:56:36,916 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-11-23 14:56:36,916 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-11-23 14:56:36,916 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 14:56:36,916 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 611) no Hoare annotation was computed. [2023-11-23 14:56:36,916 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2023-11-23 14:56:36,916 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2023-11-23 14:56:36,916 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 14:56:36,916 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 613 627) no Hoare annotation was computed. [2023-11-23 14:56:36,916 INFO L899 garLoopResultBuilder]: For program point L621(lines 621 623) no Hoare annotation was computed. [2023-11-23 14:56:36,917 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0))) (or (let ((.cse0 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse2 (select .cse0 4))) (and (= (select .cse0 0) 0) .cse1 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 0) (not (= .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= .cse2 |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= .cse2 0)) .cse3 .cse4 .cse5 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)))) (let ((.cse6 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and .cse1 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= (select .cse6 4) 0) .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select .cse6 0) 0))))) [2023-11-23 14:56:36,917 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2023-11-23 14:56:36,917 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-11-23 14:56:36,917 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-11-23 14:56:36,917 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#valid)| |#valid|)) [2023-11-23 14:56:36,917 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-11-23 14:56:36,920 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-11-23 14:56:36,921 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 14:56:36,931 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-11-23 14:56:36,932 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated [2023-11-23 14:56:36,932 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated [2023-11-23 14:56:36,932 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated [2023-11-23 14:56:36,932 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated [2023-11-23 14:56:36,932 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated [2023-11-23 14:56:36,933 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated [2023-11-23 14:56:36,933 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_14 : int :: (((#memory_$Pointer$#2.offset[v_arrayElimCell_14][0] == 0 && !(#memory_$Pointer$#1.base[~#s~0!base][0] == v_arrayElimCell_14)) && #memory_$Pointer$#1.base[~#s~0!base][0] == #memory_$Pointer$#2.base[v_arrayElimCell_14][4]) && #memory_$Pointer$#2.offset[v_arrayElimCell_14][4] == 0) && #memory_$Pointer$#1.base[~#s~0!base][0] == #memory_$Pointer$#2.base[v_arrayElimCell_14][0]) could not be translated [2023-11-23 14:56:36,933 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated [2023-11-23 14:56:36,933 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated [2023-11-23 14:56:36,933 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated [2023-11-23 14:56:36,933 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated [2023-11-23 14:56:36,934 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][0] could not be translated [2023-11-23 14:56:36,934 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][0] could not be translated [2023-11-23 14:56:36,934 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-23 14:56:36,934 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated [2023-11-23 14:56:36,934 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated [2023-11-23 14:56:36,934 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-23 14:56:36,935 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~last~0!base][0] could not be translated [2023-11-23 14:56:36,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~last~0!base][4] could not be translated [2023-11-23 14:56:36,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~last~0!base][4] could not be translated [2023-11-23 14:56:36,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~last~0!base][4] could not be translated [2023-11-23 14:56:36,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~last~0!base][4] could not be translated [2023-11-23 14:56:36,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-23 14:56:36,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][4] could not be translated [2023-11-23 14:56:36,937 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][0] could not be translated [2023-11-23 14:56:36,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:56:36 BoogieIcfgContainer [2023-11-23 14:56:36,937 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 14:56:36,938 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 14:56:36,938 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 14:56:36,938 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 14:56:36,938 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:56:29" (3/4) ... [2023-11-23 14:56:36,940 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 14:56:36,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-23 14:56:36,945 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-23 14:56:36,945 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 14:56:36,945 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 14:56:36,945 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 14:56:37,008 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 14:56:37,008 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 14:56:37,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 14:56:37,009 INFO L158 Benchmark]: Toolchain (without parser) took 8423.97ms. Allocated memory was 184.5MB in the beginning and 314.6MB in the end (delta: 130.0MB). Free memory was 114.0MB in the beginning and 146.3MB in the end (delta: -32.3MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2023-11-23 14:56:37,009 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 14:56:37,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.12ms. Allocated memory is still 184.5MB. Free memory was 113.8MB in the beginning and 96.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-23 14:56:37,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.33ms. Allocated memory is still 184.5MB. Free memory was 96.3MB in the beginning and 94.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 14:56:37,010 INFO L158 Benchmark]: Boogie Preprocessor took 38.91ms. Allocated memory is still 184.5MB. Free memory was 94.0MB in the beginning and 91.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 14:56:37,010 INFO L158 Benchmark]: RCFGBuilder took 401.81ms. Allocated memory is still 184.5MB. Free memory was 91.3MB in the beginning and 73.6MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-23 14:56:37,010 INFO L158 Benchmark]: TraceAbstraction took 7531.49ms. Allocated memory was 184.5MB in the beginning and 314.6MB in the end (delta: 130.0MB). Free memory was 73.1MB in the beginning and 151.6MB in the end (delta: -78.5MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. [2023-11-23 14:56:37,010 INFO L158 Benchmark]: Witness Printer took 70.90ms. Allocated memory is still 314.6MB. Free memory was 150.5MB in the beginning and 146.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 14:56:37,011 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.12ms. Allocated memory is still 184.5MB. Free memory was 113.8MB in the beginning and 96.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.33ms. Allocated memory is still 184.5MB. Free memory was 96.3MB in the beginning and 94.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.91ms. Allocated memory is still 184.5MB. Free memory was 94.0MB in the beginning and 91.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 401.81ms. Allocated memory is still 184.5MB. Free memory was 91.3MB in the beginning and 73.6MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7531.49ms. Allocated memory was 184.5MB in the beginning and 314.6MB in the end (delta: 130.0MB). Free memory was 73.1MB in the beginning and 151.6MB in the end (delta: -78.5MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. * Witness Printer took 70.90ms. Allocated memory is still 314.6MB. Free memory was 150.5MB in the beginning and 146.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_14 : int :: (((#memory_$Pointer$#2.offset[v_arrayElimCell_14][0] == 0 && !(#memory_$Pointer$#1.base[~#s~0!base][0] == v_arrayElimCell_14)) && #memory_$Pointer$#1.base[~#s~0!base][0] == #memory_$Pointer$#2.base[v_arrayElimCell_14][4]) && #memory_$Pointer$#2.offset[v_arrayElimCell_14][4] == 0) && #memory_$Pointer$#1.base[~#s~0!base][0] == #memory_$Pointer$#2.base[v_arrayElimCell_14][0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~last~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][0] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 625]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 493 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 377 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 579 IncrementalHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 116 mSDtfsCounter, 579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 8 PreInvPairs, 15 NumberOfFragments, 395 HoareAnnotationTreeSize, 8 FomulaSimplifications, 6 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 37 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 323 ConstructedInterpolants, 2 QuantifiedInterpolants, 1999 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1402 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 98/115 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((len == 2) || ((len == 2) && (i <= 1))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((len == 2) && (len <= 1)) || ((2 == len) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2023-11-23 14:56:37,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE