./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.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 06cf0f0e06098dbd1136039511f326932a550d3a95d6c25d31884324ad030bdc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:40:00,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:40:00,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:40:00,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:40:00,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:40:01,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:40:01,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:40:01,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:40:01,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:40:01,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:40:01,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:40:01,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:40:01,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:40:01,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:40:01,044 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:40:01,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:40:01,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:40:01,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:40:01,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:40:01,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:40:01,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:40:01,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:40:01,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:40:01,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:40:01,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:40:01,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:40:01,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:40:01,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:40:01,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:40:01,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:40:01,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:40:01,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:40:01,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:40:01,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:40:01,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:40:01,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:40:01,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:40:01,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:40:01,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:40:01,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:40:01,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:40:01,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:40:01,052 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 -> 06cf0f0e06098dbd1136039511f326932a550d3a95d6c25d31884324ad030bdc [2024-10-24 11:40:01,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:40:01,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:40:01,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:40:01,329 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:40:01,330 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:40:01,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2024-10-24 11:40:02,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:40:03,065 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:40:03,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2024-10-24 11:40:03,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b2cd017/72582a950c4649049394c74118cdd4af/FLAG3872b62f9 [2024-10-24 11:40:03,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b2cd017/72582a950c4649049394c74118cdd4af [2024-10-24 11:40:03,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:40:03,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:40:03,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:40:03,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:40:03,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:40:03,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@742a8a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03, skipping insertion in model container [2024-10-24 11:40:03,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:40:03,346 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i[916,929] [2024-10-24 11:40:03,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:40:03,438 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:40:03,450 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i[916,929] [2024-10-24 11:40:03,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:40:03,516 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:40:03,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03 WrapperNode [2024-10-24 11:40:03,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:40:03,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:40:03,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:40:03,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:40:03,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,569 INFO L138 Inliner]: procedures = 26, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 350 [2024-10-24 11:40:03,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:40:03,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:40:03,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:40:03,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:40:03,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,624 INFO L175 MemorySlicer]: Split 87 memory accesses to 11 slices as follows [2, 6, 5, 10, 18, 4, 12, 11, 10, 5, 4]. 21 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 1, 2, 1, 1, 1, 1, 4, 1, 1, 1]. [2024-10-24 11:40:03,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:40:03,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:40:03,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:40:03,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:40:03,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (1/1) ... [2024-10-24 11:40:03,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:40:03,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:40:03,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:40:03,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:40:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:40:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:40:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:40:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 11:40:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 11:40:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 11:40:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 11:40:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-24 11:40:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:40:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:40:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:40:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:40:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:40:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:40:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 11:40:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 11:40:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 11:40:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 11:40:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-24 11:40:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:40:03,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:40:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:40:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:40:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:40:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:40:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:40:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:40:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 11:40:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 11:40:03,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 11:40:03,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 11:40:03,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-24 11:40:03,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:40:03,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:40:03,941 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:40:03,943 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:40:04,381 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-10-24 11:40:04,381 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:40:04,425 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:40:04,426 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:40:04,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:40:04 BoogieIcfgContainer [2024-10-24 11:40:04,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:40:04,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:40:04,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:40:04,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:40:04,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:40:03" (1/3) ... [2024-10-24 11:40:04,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f40bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:40:04, skipping insertion in model container [2024-10-24 11:40:04,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:03" (2/3) ... [2024-10-24 11:40:04,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f40bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:40:04, skipping insertion in model container [2024-10-24 11:40:04,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:40:04" (3/3) ... [2024-10-24 11:40:04,433 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-62.i [2024-10-24 11:40:04,447 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:40:04,448 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:40:04,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:40:04,518 INFO L333 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, 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;@3dc26360, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:40:04,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:40:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:40:04,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 11:40:04,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:04,535 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:04,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:04,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash -710106841, now seen corresponding path program 1 times [2024-10-24 11:40:04,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:04,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198063910] [2024-10-24 11:40:04,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:04,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:04,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198063910] [2024-10-24 11:40:04,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198063910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:04,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:04,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:40:04,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982640544] [2024-10-24 11:40:04,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:04,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:40:04,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:04,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:40:04,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:40:04,947 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:40:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:04,991 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2024-10-24 11:40:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:40:04,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2024-10-24 11:40:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:05,003 INFO L225 Difference]: With dead ends: 129 [2024-10-24 11:40:05,004 INFO L226 Difference]: Without dead ends: 64 [2024-10-24 11:40:05,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:40:05,013 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:05,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-24 11:40:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-24 11:40:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:40:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2024-10-24 11:40:05,079 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2024-10-24 11:40:05,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:05,079 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2024-10-24 11:40:05,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:40:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2024-10-24 11:40:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 11:40:05,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:05,083 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:05,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:40:05,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:05,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash -770566889, now seen corresponding path program 1 times [2024-10-24 11:40:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:05,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135216799] [2024-10-24 11:40:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:05,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:05,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:05,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135216799] [2024-10-24 11:40:05,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135216799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:05,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:05,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:40:05,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682732000] [2024-10-24 11:40:05,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:05,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:40:05,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:40:05,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:05,446 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:05,505 INFO L93 Difference]: Finished difference Result 130 states and 187 transitions. [2024-10-24 11:40:05,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:40:05,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-24 11:40:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:05,508 INFO L225 Difference]: With dead ends: 130 [2024-10-24 11:40:05,508 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 11:40:05,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:05,510 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:05,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 11:40:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-24 11:40:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:40:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2024-10-24 11:40:05,524 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 68 [2024-10-24 11:40:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:05,528 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2024-10-24 11:40:05,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2024-10-24 11:40:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 11:40:05,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:05,531 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:05,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:40:05,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:05,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:05,532 INFO L85 PathProgramCache]: Analyzing trace with hash -713308587, now seen corresponding path program 1 times [2024-10-24 11:40:05,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:05,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520226474] [2024-10-24 11:40:05,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:05,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:05,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:05,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520226474] [2024-10-24 11:40:05,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520226474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:05,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:05,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:40:05,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368855798] [2024-10-24 11:40:05,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:05,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:40:05,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:05,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:40:05,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:05,731 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:05,788 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2024-10-24 11:40:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:40:05,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-24 11:40:05,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:05,796 INFO L225 Difference]: With dead ends: 134 [2024-10-24 11:40:05,796 INFO L226 Difference]: Without dead ends: 69 [2024-10-24 11:40:05,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:05,799 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:05,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 252 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:05,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-24 11:40:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-24 11:40:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:40:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-24 11:40:05,813 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 68 [2024-10-24 11:40:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:05,813 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-24 11:40:05,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-24 11:40:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 11:40:05,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:05,816 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:05,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:40:05,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:05,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:05,817 INFO L85 PathProgramCache]: Analyzing trace with hash -713249005, now seen corresponding path program 1 times [2024-10-24 11:40:05,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:05,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518689947] [2024-10-24 11:40:05,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:05,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:06,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:06,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518689947] [2024-10-24 11:40:06,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518689947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:06,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:06,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:40:06,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054523774] [2024-10-24 11:40:06,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:06,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:40:06,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:06,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:40:06,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:06,126 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:06,195 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2024-10-24 11:40:06,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:40:06,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-24 11:40:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:06,199 INFO L225 Difference]: With dead ends: 160 [2024-10-24 11:40:06,199 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:40:06,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:06,201 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 86 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:06,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 260 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:06,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:40:06,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2024-10-24 11:40:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:40:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2024-10-24 11:40:06,212 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 68 [2024-10-24 11:40:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:06,214 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2024-10-24 11:40:06,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2024-10-24 11:40:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 11:40:06,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:06,216 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:06,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:40:06,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:06,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash -637477704, now seen corresponding path program 1 times [2024-10-24 11:40:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:06,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560198869] [2024-10-24 11:40:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:06,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:06,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560198869] [2024-10-24 11:40:06,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560198869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:06,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:06,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:40:06,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606877692] [2024-10-24 11:40:06,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:06,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:40:06,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:06,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:40:06,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:06,477 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:06,599 INFO L93 Difference]: Finished difference Result 205 states and 287 transitions. [2024-10-24 11:40:06,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:40:06,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2024-10-24 11:40:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:06,602 INFO L225 Difference]: With dead ends: 205 [2024-10-24 11:40:06,602 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 11:40:06,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:40:06,607 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 87 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:06,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 637 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 11:40:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 78. [2024-10-24 11:40:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 68 states have internal predecessors, (93), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:40:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-10-24 11:40:06,616 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 70 [2024-10-24 11:40:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:06,616 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-10-24 11:40:06,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2024-10-24 11:40:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 11:40:06,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:06,618 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:06,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:40:06,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:06,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2026116434, now seen corresponding path program 1 times [2024-10-24 11:40:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:06,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867776447] [2024-10-24 11:40:06,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:06,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:06,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867776447] [2024-10-24 11:40:06,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867776447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:06,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:06,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:06,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223944872] [2024-10-24 11:40:06,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:06,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:06,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:06,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:06,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:06,900 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:06,982 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2024-10-24 11:40:06,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:06,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-10-24 11:40:06,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:06,988 INFO L225 Difference]: With dead ends: 188 [2024-10-24 11:40:06,988 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 11:40:06,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:06,989 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:06,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 445 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 11:40:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2024-10-24 11:40:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:40:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-10-24 11:40:07,004 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 72 [2024-10-24 11:40:07,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:07,005 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-10-24 11:40:07,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-10-24 11:40:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 11:40:07,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:07,007 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:07,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:40:07,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:07,010 INFO L85 PathProgramCache]: Analyzing trace with hash -22400883, now seen corresponding path program 1 times [2024-10-24 11:40:07,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:07,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867246418] [2024-10-24 11:40:07,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:07,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:07,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:07,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867246418] [2024-10-24 11:40:07,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867246418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:07,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:07,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:07,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383327427] [2024-10-24 11:40:07,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:07,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:07,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:07,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:07,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:07,170 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:07,208 INFO L93 Difference]: Finished difference Result 158 states and 219 transitions. [2024-10-24 11:40:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:07,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-10-24 11:40:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:07,209 INFO L225 Difference]: With dead ends: 158 [2024-10-24 11:40:07,209 INFO L226 Difference]: Without dead ends: 81 [2024-10-24 11:40:07,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:07,211 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:07,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-24 11:40:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-24 11:40:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:40:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2024-10-24 11:40:07,217 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 72 [2024-10-24 11:40:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:07,217 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2024-10-24 11:40:07,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2024-10-24 11:40:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 11:40:07,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:07,219 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:07,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:40:07,219 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:07,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:07,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1221843874, now seen corresponding path program 1 times [2024-10-24 11:40:07,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:07,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469109374] [2024-10-24 11:40:07,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:07,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:07,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:07,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469109374] [2024-10-24 11:40:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469109374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:07,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412921179] [2024-10-24 11:40:07,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:07,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:07,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:07,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:07,425 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:07,494 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2024-10-24 11:40:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:07,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-10-24 11:40:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:07,496 INFO L225 Difference]: With dead ends: 192 [2024-10-24 11:40:07,496 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 11:40:07,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:07,497 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:07,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 338 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 11:40:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2024-10-24 11:40:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:40:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2024-10-24 11:40:07,506 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 72 [2024-10-24 11:40:07,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:07,507 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2024-10-24 11:40:07,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2024-10-24 11:40:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 11:40:07,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:07,508 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:07,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:40:07,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:07,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1308385672, now seen corresponding path program 1 times [2024-10-24 11:40:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:07,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401914813] [2024-10-24 11:40:07,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:07,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-24 11:40:08,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:08,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401914813] [2024-10-24 11:40:08,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401914813] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:08,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616777052] [2024-10-24 11:40:08,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:08,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:40:08,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:40:08,065 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) [2024-10-24 11:40:08,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:40:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:08,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 11:40:08,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:08,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:08,646 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 19 treesize of output 11 [2024-10-24 11:40:08,658 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 17 treesize of output 9 [2024-10-24 11:40:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 11:40:08,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:40:08,759 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 21 treesize of output 13 [2024-10-24 11:40:08,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 32 treesize of output 28 [2024-10-24 11:40:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-24 11:40:08,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616777052] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:40:08,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:40:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2024-10-24 11:40:09,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543129778] [2024-10-24 11:40:09,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:40:09,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 11:40:09,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:09,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 11:40:09,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:40:09,002 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 22 states, 19 states have (on average 3.526315789473684) internal successors, (67), 22 states have internal predecessors, (67), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-24 11:40:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:09,864 INFO L93 Difference]: Finished difference Result 296 states and 392 transitions. [2024-10-24 11:40:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 11:40:09,865 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.526315789473684) internal successors, (67), 22 states have internal predecessors, (67), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) Word has length 74 [2024-10-24 11:40:09,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:09,866 INFO L225 Difference]: With dead ends: 296 [2024-10-24 11:40:09,867 INFO L226 Difference]: Without dead ends: 216 [2024-10-24 11:40:09,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1440, Unknown=0, NotChecked=0, Total=1806 [2024-10-24 11:40:09,870 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 700 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:09,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 698 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:40:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-24 11:40:09,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 204. [2024-10-24 11:40:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.3005464480874316) internal successors, (238), 185 states have internal predecessors, (238), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:40:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 270 transitions. [2024-10-24 11:40:09,900 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 270 transitions. Word has length 74 [2024-10-24 11:40:09,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:09,900 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 270 transitions. [2024-10-24 11:40:09,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.526315789473684) internal successors, (67), 22 states have internal predecessors, (67), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-24 11:40:09,901 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 270 transitions. [2024-10-24 11:40:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 11:40:09,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:09,902 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:09,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:40:10,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:40:10,103 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:10,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1697474561, now seen corresponding path program 1 times [2024-10-24 11:40:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:10,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153050685] [2024-10-24 11:40:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:11,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153050685] [2024-10-24 11:40:11,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153050685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:11,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:11,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:40:11,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329340545] [2024-10-24 11:40:11,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:11,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:40:11,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:11,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:40:11,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:40:11,246 INFO L87 Difference]: Start difference. First operand 204 states and 270 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 11:40:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:12,180 INFO L93 Difference]: Finished difference Result 422 states and 555 transitions. [2024-10-24 11:40:12,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:40:12,181 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2024-10-24 11:40:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:12,184 INFO L225 Difference]: With dead ends: 422 [2024-10-24 11:40:12,184 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 11:40:12,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2024-10-24 11:40:12,186 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 313 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:12,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 939 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:40:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 11:40:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2024-10-24 11:40:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 187 states have (on average 1.2941176470588236) internal successors, (242), 189 states have internal predecessors, (242), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:40:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 274 transitions. [2024-10-24 11:40:12,201 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 274 transitions. Word has length 75 [2024-10-24 11:40:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:12,202 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 274 transitions. [2024-10-24 11:40:12,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 11:40:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 274 transitions. [2024-10-24 11:40:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 11:40:12,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:12,203 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:12,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:40:12,204 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:12,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1586375485, now seen corresponding path program 1 times [2024-10-24 11:40:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:12,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819604376] [2024-10-24 11:40:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:12,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:12,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819604376] [2024-10-24 11:40:12,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819604376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:12,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:12,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:40:12,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459313258] [2024-10-24 11:40:12,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:12,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:40:12,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:12,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:40:12,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:12,366 INFO L87 Difference]: Start difference. First operand 208 states and 274 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:12,471 INFO L93 Difference]: Finished difference Result 414 states and 544 transitions. [2024-10-24 11:40:12,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:40:12,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-10-24 11:40:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:12,473 INFO L225 Difference]: With dead ends: 414 [2024-10-24 11:40:12,473 INFO L226 Difference]: Without dead ends: 207 [2024-10-24 11:40:12,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:40:12,474 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 50 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:12,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 501 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-24 11:40:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2024-10-24 11:40:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.289617486338798) internal successors, (236), 185 states have internal predecessors, (236), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:40:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 268 transitions. [2024-10-24 11:40:12,491 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 268 transitions. Word has length 75 [2024-10-24 11:40:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:12,491 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 268 transitions. [2024-10-24 11:40:12,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 268 transitions. [2024-10-24 11:40:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 11:40:12,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:12,494 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:12,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:40:12,494 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:12,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1478619843, now seen corresponding path program 1 times [2024-10-24 11:40:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:12,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136132893] [2024-10-24 11:40:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:12,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:12,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136132893] [2024-10-24 11:40:12,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136132893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:12,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:12,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:40:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237304334] [2024-10-24 11:40:12,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:12,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:40:12,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:12,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:40:12,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:12,645 INFO L87 Difference]: Start difference. First operand 204 states and 268 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:12,762 INFO L93 Difference]: Finished difference Result 459 states and 598 transitions. [2024-10-24 11:40:12,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:40:12,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-10-24 11:40:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:12,764 INFO L225 Difference]: With dead ends: 459 [2024-10-24 11:40:12,764 INFO L226 Difference]: Without dead ends: 247 [2024-10-24 11:40:12,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:40:12,765 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 61 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:12,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 513 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-24 11:40:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 208. [2024-10-24 11:40:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 186 states have (on average 1.2688172043010753) internal successors, (236), 188 states have internal predecessors, (236), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:40:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 268 transitions. [2024-10-24 11:40:12,780 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 268 transitions. Word has length 75 [2024-10-24 11:40:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:12,780 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 268 transitions. [2024-10-24 11:40:12,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 268 transitions. [2024-10-24 11:40:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 11:40:12,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:12,782 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:12,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:40:12,782 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:12,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:12,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1805230203, now seen corresponding path program 1 times [2024-10-24 11:40:12,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:12,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104028003] [2024-10-24 11:40:12,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:12,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:13,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:13,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:13,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:13,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:13,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:13,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:13,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104028003] [2024-10-24 11:40:13,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104028003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:13,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:13,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 11:40:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139301308] [2024-10-24 11:40:13,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:13,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 11:40:13,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:13,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 11:40:13,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:40:13,786 INFO L87 Difference]: Start difference. First operand 208 states and 268 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 11:40:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:15,040 INFO L93 Difference]: Finished difference Result 848 states and 1078 transitions. [2024-10-24 11:40:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 11:40:15,041 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2024-10-24 11:40:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:15,045 INFO L225 Difference]: With dead ends: 848 [2024-10-24 11:40:15,045 INFO L226 Difference]: Without dead ends: 641 [2024-10-24 11:40:15,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 11:40:15,048 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 754 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:15,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1245 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:40:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-10-24 11:40:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 381. [2024-10-24 11:40:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 340 states have (on average 1.261764705882353) internal successors, (429), 343 states have internal predecessors, (429), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:40:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 489 transitions. [2024-10-24 11:40:15,086 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 489 transitions. Word has length 75 [2024-10-24 11:40:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:15,086 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 489 transitions. [2024-10-24 11:40:15,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 11:40:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 489 transitions. [2024-10-24 11:40:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 11:40:15,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:15,089 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:15,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:40:15,089 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:15,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:15,089 INFO L85 PathProgramCache]: Analyzing trace with hash -374470502, now seen corresponding path program 1 times [2024-10-24 11:40:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:15,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920094874] [2024-10-24 11:40:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:15,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:15,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920094874] [2024-10-24 11:40:15,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920094874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:15,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:15,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:40:15,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530556827] [2024-10-24 11:40:15,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:15,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:40:15,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:15,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:40:15,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:15,242 INFO L87 Difference]: Start difference. First operand 381 states and 489 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:15,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:15,302 INFO L93 Difference]: Finished difference Result 781 states and 1002 transitions. [2024-10-24 11:40:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:40:15,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-10-24 11:40:15,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:15,305 INFO L225 Difference]: With dead ends: 781 [2024-10-24 11:40:15,307 INFO L226 Difference]: Without dead ends: 401 [2024-10-24 11:40:15,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:15,309 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:15,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:15,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-24 11:40:15,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 386. [2024-10-24 11:40:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 345 states have (on average 1.2579710144927536) internal successors, (434), 348 states have internal predecessors, (434), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:40:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 494 transitions. [2024-10-24 11:40:15,339 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 494 transitions. Word has length 75 [2024-10-24 11:40:15,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:15,339 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 494 transitions. [2024-10-24 11:40:15,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 494 transitions. [2024-10-24 11:40:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 11:40:15,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:15,341 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:15,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:40:15,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:15,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:15,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1071944993, now seen corresponding path program 1 times [2024-10-24 11:40:15,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:15,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712010558] [2024-10-24 11:40:15,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:15,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:15,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:15,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712010558] [2024-10-24 11:40:15,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712010558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:15,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:15,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:40:15,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499069515] [2024-10-24 11:40:15,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:15,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:40:15,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:15,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:40:15,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:15,510 INFO L87 Difference]: Start difference. First operand 386 states and 494 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:15,642 INFO L93 Difference]: Finished difference Result 881 states and 1119 transitions. [2024-10-24 11:40:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:40:15,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-10-24 11:40:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:15,645 INFO L225 Difference]: With dead ends: 881 [2024-10-24 11:40:15,646 INFO L226 Difference]: Without dead ends: 496 [2024-10-24 11:40:15,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:40:15,649 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 49 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:15,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 422 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-24 11:40:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 377. [2024-10-24 11:40:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 338 states have (on average 1.2337278106508875) internal successors, (417), 340 states have internal predecessors, (417), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:40:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 473 transitions. [2024-10-24 11:40:15,692 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 473 transitions. Word has length 75 [2024-10-24 11:40:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:15,693 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 473 transitions. [2024-10-24 11:40:15,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 473 transitions. [2024-10-24 11:40:15,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 11:40:15,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:15,695 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:15,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:40:15,695 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:15,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash -843101452, now seen corresponding path program 1 times [2024-10-24 11:40:15,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:15,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475022459] [2024-10-24 11:40:15,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:15,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:16,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:16,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:16,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:16,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:16,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:16,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:16,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-24 11:40:16,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:16,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475022459] [2024-10-24 11:40:16,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475022459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:16,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180175114] [2024-10-24 11:40:16,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:16,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:40:16,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:40:16,133 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) [2024-10-24 11:40:16,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:40:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:16,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:40:16,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:16,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:16,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:16,700 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 15 treesize of output 7 [2024-10-24 11:40:16,709 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 19 treesize of output 11 [2024-10-24 11:40:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 11:40:16,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:40:16,893 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 36 treesize of output 32 [2024-10-24 11:40:16,990 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 35 treesize of output 31 [2024-10-24 11:40:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-24 11:40:17,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180175114] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:40:17,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:40:17,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-10-24 11:40:17,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270170143] [2024-10-24 11:40:17,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:40:17,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 11:40:17,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:17,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 11:40:17,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:40:17,041 INFO L87 Difference]: Start difference. First operand 377 states and 473 transitions. Second operand has 22 states, 19 states have (on average 4.315789473684211) internal successors, (82), 21 states have internal predecessors, (82), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-24 11:40:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:17,519 INFO L93 Difference]: Finished difference Result 739 states and 927 transitions. [2024-10-24 11:40:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:40:17,520 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 4.315789473684211) internal successors, (82), 21 states have internal predecessors, (82), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) Word has length 75 [2024-10-24 11:40:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:17,522 INFO L225 Difference]: With dead ends: 739 [2024-10-24 11:40:17,522 INFO L226 Difference]: Without dead ends: 363 [2024-10-24 11:40:17,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=822, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 11:40:17,524 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 251 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:17,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 374 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:40:17,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-24 11:40:17,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 347. [2024-10-24 11:40:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 308 states have (on average 1.2305194805194806) internal successors, (379), 310 states have internal predecessors, (379), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:40:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 435 transitions. [2024-10-24 11:40:17,550 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 435 transitions. Word has length 75 [2024-10-24 11:40:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:17,551 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 435 transitions. [2024-10-24 11:40:17,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 4.315789473684211) internal successors, (82), 21 states have internal predecessors, (82), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-24 11:40:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 435 transitions. [2024-10-24 11:40:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 11:40:17,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:17,552 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:17,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:40:17,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-24 11:40:17,757 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:17,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash 110180799, now seen corresponding path program 1 times [2024-10-24 11:40:17,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:17,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312107453] [2024-10-24 11:40:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:17,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:18,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:18,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:18,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:18,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:18,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:18,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-24 11:40:18,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312107453] [2024-10-24 11:40:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312107453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464646516] [2024-10-24 11:40:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:18,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:40:18,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:40:18,879 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) [2024-10-24 11:40:18,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 11:40:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:40:19,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:19,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:19,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:19,311 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 57 treesize of output 45 [2024-10-24 11:40:19,380 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 49 treesize of output 29 [2024-10-24 11:40:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 11:40:19,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:40:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:19,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464646516] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:19,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:40:19,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19, 10] total 26 [2024-10-24 11:40:19,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982903781] [2024-10-24 11:40:19,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:19,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:40:19,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:19,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:40:19,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2024-10-24 11:40:19,750 INFO L87 Difference]: Start difference. First operand 347 states and 435 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:20,198 INFO L93 Difference]: Finished difference Result 855 states and 1070 transitions. [2024-10-24 11:40:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:40:20,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2024-10-24 11:40:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:20,202 INFO L225 Difference]: With dead ends: 855 [2024-10-24 11:40:20,202 INFO L226 Difference]: Without dead ends: 509 [2024-10-24 11:40:20,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2024-10-24 11:40:20,204 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 50 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:20,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 868 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:40:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-24 11:40:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 168. [2024-10-24 11:40:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 148 states have (on average 1.2297297297297298) internal successors, (182), 149 states have internal predecessors, (182), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:40:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 210 transitions. [2024-10-24 11:40:20,224 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 210 transitions. Word has length 76 [2024-10-24 11:40:20,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:20,224 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 210 transitions. [2024-10-24 11:40:20,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 210 transitions. [2024-10-24 11:40:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 11:40:20,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:20,226 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:20,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 11:40:20,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:40:20,427 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:20,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:20,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1631279565, now seen corresponding path program 1 times [2024-10-24 11:40:20,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:20,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642254792] [2024-10-24 11:40:20,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:20,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:20,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:20,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642254792] [2024-10-24 11:40:20,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642254792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:20,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:20,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:20,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455341649] [2024-10-24 11:40:20,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:20,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:20,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:20,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:20,582 INFO L87 Difference]: Start difference. First operand 168 states and 210 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:20,649 INFO L93 Difference]: Finished difference Result 403 states and 504 transitions. [2024-10-24 11:40:20,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:20,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-10-24 11:40:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:20,651 INFO L225 Difference]: With dead ends: 403 [2024-10-24 11:40:20,651 INFO L226 Difference]: Without dead ends: 236 [2024-10-24 11:40:20,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:20,652 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 41 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:20,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 299 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:20,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-24 11:40:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 168. [2024-10-24 11:40:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 148 states have (on average 1.2162162162162162) internal successors, (180), 149 states have internal predecessors, (180), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:40:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2024-10-24 11:40:20,668 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 77 [2024-10-24 11:40:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:20,668 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2024-10-24 11:40:20,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2024-10-24 11:40:20,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 11:40:20,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:20,669 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:20,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:40:20,670 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:20,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:20,670 INFO L85 PathProgramCache]: Analyzing trace with hash 708920067, now seen corresponding path program 1 times [2024-10-24 11:40:20,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:20,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567289517] [2024-10-24 11:40:20,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:20,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:20,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:20,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567289517] [2024-10-24 11:40:20,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567289517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:20,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:20,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:20,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814874319] [2024-10-24 11:40:20,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:20,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:20,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:20,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:20,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:20,846 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:20,918 INFO L93 Difference]: Finished difference Result 395 states and 492 transitions. [2024-10-24 11:40:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:20,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2024-10-24 11:40:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:20,921 INFO L225 Difference]: With dead ends: 395 [2024-10-24 11:40:20,921 INFO L226 Difference]: Without dead ends: 228 [2024-10-24 11:40:20,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:20,922 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:20,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 299 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-24 11:40:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 178. [2024-10-24 11:40:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 159 states have internal predecessors, (190), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:40:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 218 transitions. [2024-10-24 11:40:20,941 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 218 transitions. Word has length 78 [2024-10-24 11:40:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:20,943 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 218 transitions. [2024-10-24 11:40:20,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 218 transitions. [2024-10-24 11:40:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 11:40:20,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:20,944 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:20,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:40:20,944 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:20,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1207142703, now seen corresponding path program 1 times [2024-10-24 11:40:20,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:20,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952528193] [2024-10-24 11:40:20,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:20,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:21,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952528193] [2024-10-24 11:40:21,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952528193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:21,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:21,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:40:21,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199924370] [2024-10-24 11:40:21,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:21,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:40:21,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:40:21,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:40:21,439 INFO L87 Difference]: Start difference. First operand 178 states and 218 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-24 11:40:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:21,876 INFO L93 Difference]: Finished difference Result 491 states and 594 transitions. [2024-10-24 11:40:21,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:40:21,877 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 78 [2024-10-24 11:40:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:21,879 INFO L225 Difference]: With dead ends: 491 [2024-10-24 11:40:21,879 INFO L226 Difference]: Without dead ends: 314 [2024-10-24 11:40:21,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:40:21,881 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 242 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:21,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 595 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:40:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-24 11:40:21,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 294. [2024-10-24 11:40:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 262 states have (on average 1.183206106870229) internal successors, (310), 265 states have internal predecessors, (310), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:40:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 354 transitions. [2024-10-24 11:40:21,916 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 354 transitions. Word has length 78 [2024-10-24 11:40:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:21,916 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 354 transitions. [2024-10-24 11:40:21,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-24 11:40:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 354 transitions. [2024-10-24 11:40:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 11:40:21,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:21,917 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:21,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:40:21,918 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:21,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1425997421, now seen corresponding path program 1 times [2024-10-24 11:40:21,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:21,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396653965] [2024-10-24 11:40:21,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:21,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:22,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:22,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396653965] [2024-10-24 11:40:22,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396653965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:22,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:22,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:22,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304295498] [2024-10-24 11:40:22,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:22,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:22,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:22,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:22,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:22,013 INFO L87 Difference]: Start difference. First operand 294 states and 354 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:22,134 INFO L93 Difference]: Finished difference Result 673 states and 810 transitions. [2024-10-24 11:40:22,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:22,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2024-10-24 11:40:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:22,138 INFO L225 Difference]: With dead ends: 673 [2024-10-24 11:40:22,138 INFO L226 Difference]: Without dead ends: 380 [2024-10-24 11:40:22,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:22,140 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 41 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:22,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 397 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-24 11:40:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 320. [2024-10-24 11:40:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 288 states have (on average 1.1736111111111112) internal successors, (338), 291 states have internal predecessors, (338), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:40:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 382 transitions. [2024-10-24 11:40:22,168 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 382 transitions. Word has length 78 [2024-10-24 11:40:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:22,169 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 382 transitions. [2024-10-24 11:40:22,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 382 transitions. [2024-10-24 11:40:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 11:40:22,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:22,170 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:22,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 11:40:22,170 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:22,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2119412344, now seen corresponding path program 1 times [2024-10-24 11:40:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:22,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976330717] [2024-10-24 11:40:22,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:22,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:22,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976330717] [2024-10-24 11:40:22,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976330717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:22,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:22,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:22,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961072626] [2024-10-24 11:40:22,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:22,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:22,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:22,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:22,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:22,588 INFO L87 Difference]: Start difference. First operand 320 states and 382 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:22,719 INFO L93 Difference]: Finished difference Result 370 states and 441 transitions. [2024-10-24 11:40:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:22,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-10-24 11:40:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:22,722 INFO L225 Difference]: With dead ends: 370 [2024-10-24 11:40:22,722 INFO L226 Difference]: Without dead ends: 368 [2024-10-24 11:40:22,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:40:22,723 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 60 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:22,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 341 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-24 11:40:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2024-10-24 11:40:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 319 states have (on average 1.1567398119122256) internal successors, (369), 323 states have internal predecessors, (369), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:40:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 429 transitions. [2024-10-24 11:40:22,765 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 429 transitions. Word has length 80 [2024-10-24 11:40:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:22,765 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 429 transitions. [2024-10-24 11:40:22,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 429 transitions. [2024-10-24 11:40:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 11:40:22,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:22,767 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:22,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 11:40:22,767 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:22,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:22,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2119352762, now seen corresponding path program 1 times [2024-10-24 11:40:22,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:22,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657128397] [2024-10-24 11:40:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:22,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:22,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657128397] [2024-10-24 11:40:22,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657128397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:22,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:22,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:22,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472007459] [2024-10-24 11:40:22,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:22,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:22,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:22,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:22,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:22,921 INFO L87 Difference]: Start difference. First operand 364 states and 429 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:23,012 INFO L93 Difference]: Finished difference Result 695 states and 821 transitions. [2024-10-24 11:40:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:23,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-10-24 11:40:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:23,015 INFO L225 Difference]: With dead ends: 695 [2024-10-24 11:40:23,015 INFO L226 Difference]: Without dead ends: 368 [2024-10-24 11:40:23,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:40:23,018 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 48 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:23,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 323 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-24 11:40:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 211. [2024-10-24 11:40:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 183 states have (on average 1.1475409836065573) internal successors, (210), 185 states have internal predecessors, (210), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:40:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 246 transitions. [2024-10-24 11:40:23,051 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 246 transitions. Word has length 80 [2024-10-24 11:40:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:23,052 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 246 transitions. [2024-10-24 11:40:23,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 246 transitions. [2024-10-24 11:40:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 11:40:23,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:23,053 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:23,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 11:40:23,053 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:23,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2062094460, now seen corresponding path program 1 times [2024-10-24 11:40:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:23,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165521535] [2024-10-24 11:40:23,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:23,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:23,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165521535] [2024-10-24 11:40:23,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165521535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:23,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:23,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:40:23,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907691133] [2024-10-24 11:40:23,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:23,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:40:23,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:23,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:40:23,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:40:23,490 INFO L87 Difference]: Start difference. First operand 211 states and 246 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:40:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:23,706 INFO L93 Difference]: Finished difference Result 519 states and 607 transitions. [2024-10-24 11:40:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:40:23,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2024-10-24 11:40:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:23,709 INFO L225 Difference]: With dead ends: 519 [2024-10-24 11:40:23,709 INFO L226 Difference]: Without dead ends: 333 [2024-10-24 11:40:23,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:40:23,710 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 165 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:23,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 311 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-24 11:40:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 295. [2024-10-24 11:40:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 267 states have (on average 1.146067415730337) internal successors, (306), 269 states have internal predecessors, (306), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:40:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 342 transitions. [2024-10-24 11:40:23,748 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 342 transitions. Word has length 80 [2024-10-24 11:40:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:23,749 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 342 transitions. [2024-10-24 11:40:23,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:40:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 342 transitions. [2024-10-24 11:40:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 11:40:23,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:23,750 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:23,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 11:40:23,751 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:23,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1186718059, now seen corresponding path program 1 times [2024-10-24 11:40:23,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:23,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585443647] [2024-10-24 11:40:23,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:23,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:23,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:23,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585443647] [2024-10-24 11:40:23,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585443647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:23,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:23,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:23,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257580178] [2024-10-24 11:40:23,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:23,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:23,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:23,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:23,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:23,910 INFO L87 Difference]: Start difference. First operand 295 states and 342 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:23,993 INFO L93 Difference]: Finished difference Result 613 states and 711 transitions. [2024-10-24 11:40:23,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2024-10-24 11:40:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:23,995 INFO L225 Difference]: With dead ends: 613 [2024-10-24 11:40:23,995 INFO L226 Difference]: Without dead ends: 343 [2024-10-24 11:40:23,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:23,997 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 31 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:24,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 382 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-24 11:40:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 257. [2024-10-24 11:40:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 229 states have (on average 1.1266375545851528) internal successors, (258), 231 states have internal predecessors, (258), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:40:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 294 transitions. [2024-10-24 11:40:24,043 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 294 transitions. Word has length 81 [2024-10-24 11:40:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:24,043 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 294 transitions. [2024-10-24 11:40:24,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 294 transitions. [2024-10-24 11:40:24,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 11:40:24,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:24,045 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:24,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 11:40:24,045 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:24,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:24,046 INFO L85 PathProgramCache]: Analyzing trace with hash 846304127, now seen corresponding path program 1 times [2024-10-24 11:40:24,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:24,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232701906] [2024-10-24 11:40:24,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:24,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:24,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232701906] [2024-10-24 11:40:24,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232701906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:24,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:24,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:24,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590565300] [2024-10-24 11:40:24,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:24,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:24,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:24,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:24,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:24,169 INFO L87 Difference]: Start difference. First operand 257 states and 294 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:24,280 INFO L93 Difference]: Finished difference Result 566 states and 643 transitions. [2024-10-24 11:40:24,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:24,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-10-24 11:40:24,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:24,283 INFO L225 Difference]: With dead ends: 566 [2024-10-24 11:40:24,283 INFO L226 Difference]: Without dead ends: 334 [2024-10-24 11:40:24,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:24,284 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 22 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:24,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 259 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-24 11:40:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 316. [2024-10-24 11:40:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 288 states have (on average 1.1145833333333333) internal successors, (321), 290 states have internal predecessors, (321), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:40:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 357 transitions. [2024-10-24 11:40:24,317 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 357 transitions. Word has length 82 [2024-10-24 11:40:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:24,317 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 357 transitions. [2024-10-24 11:40:24,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 357 transitions. [2024-10-24 11:40:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 11:40:24,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:24,318 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:24,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 11:40:24,319 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:24,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash -548655890, now seen corresponding path program 1 times [2024-10-24 11:40:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182854572] [2024-10-24 11:40:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:24,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:24,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182854572] [2024-10-24 11:40:24,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182854572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:24,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:24,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:40:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286315556] [2024-10-24 11:40:24,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:24,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:40:24,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:24,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:40:24,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:24,414 INFO L87 Difference]: Start difference. First operand 316 states and 357 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:24,483 INFO L93 Difference]: Finished difference Result 544 states and 615 transitions. [2024-10-24 11:40:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:40:24,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-10-24 11:40:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:24,486 INFO L225 Difference]: With dead ends: 544 [2024-10-24 11:40:24,486 INFO L226 Difference]: Without dead ends: 253 [2024-10-24 11:40:24,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:24,487 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:24,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-24 11:40:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-10-24 11:40:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 225 states have (on average 1.1066666666666667) internal successors, (249), 227 states have internal predecessors, (249), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:40:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 285 transitions. [2024-10-24 11:40:24,517 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 285 transitions. Word has length 82 [2024-10-24 11:40:24,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:24,517 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 285 transitions. [2024-10-24 11:40:24,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 285 transitions. [2024-10-24 11:40:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 11:40:24,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:24,520 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:24,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 11:40:24,520 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:24,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash -818166341, now seen corresponding path program 1 times [2024-10-24 11:40:24,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:24,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204733509] [2024-10-24 11:40:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:24,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:24,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:24,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204733509] [2024-10-24 11:40:24,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204733509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:24,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:24,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:40:24,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947407873] [2024-10-24 11:40:24,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:24,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:40:24,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:24,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:40:24,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:40:24,945 INFO L87 Difference]: Start difference. First operand 253 states and 285 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:40:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:25,154 INFO L93 Difference]: Finished difference Result 489 states and 552 transitions. [2024-10-24 11:40:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:40:25,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2024-10-24 11:40:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:25,156 INFO L225 Difference]: With dead ends: 489 [2024-10-24 11:40:25,157 INFO L226 Difference]: Without dead ends: 261 [2024-10-24 11:40:25,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:40:25,158 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 110 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:25,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 313 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-24 11:40:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 255. [2024-10-24 11:40:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 227 states have (on average 1.105726872246696) internal successors, (251), 229 states have internal predecessors, (251), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:40:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 287 transitions. [2024-10-24 11:40:25,187 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 287 transitions. Word has length 83 [2024-10-24 11:40:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:25,188 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 287 transitions. [2024-10-24 11:40:25,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:40:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 287 transitions. [2024-10-24 11:40:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:40:25,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:25,189 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:25,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 11:40:25,189 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:25,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash -39782315, now seen corresponding path program 1 times [2024-10-24 11:40:25,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:25,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299619947] [2024-10-24 11:40:25,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:25,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:25,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:25,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:25,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:25,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:25,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:25,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:25,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:25,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:40:25,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:25,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299619947] [2024-10-24 11:40:25,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299619947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:25,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:25,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267919704] [2024-10-24 11:40:25,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:25,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:25,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:25,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:25,339 INFO L87 Difference]: Start difference. First operand 255 states and 287 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:25,473 INFO L93 Difference]: Finished difference Result 481 states and 537 transitions. [2024-10-24 11:40:25,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:25,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2024-10-24 11:40:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:25,475 INFO L225 Difference]: With dead ends: 481 [2024-10-24 11:40:25,475 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 11:40:25,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:25,476 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 22 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:25,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 322 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 11:40:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 11:40:25,477 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) [2024-10-24 11:40:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 11:40:25,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-10-24 11:40:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:25,479 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 11:40:25,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 11:40:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 11:40:25,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 11:40:25,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:40:25,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 11:40:25,487 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:25,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 11:40:44,169 WARN L286 SmtUtils]: Spent 17.66s on a formula simplification. DAG size of input: 219 DAG size of output: 189 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-24 11:40:48,494 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:40:48,505 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2024-10-24 11:40:48,510 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2024-10-24 11:40:48,514 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,516 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-24 11:40:48,517 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-24 11:40:48,517 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,518 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2024-10-24 11:40:48,518 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2024-10-24 11:40:48,518 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,518 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2024-10-24 11:40:48,519 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2024-10-24 11:40:48,519 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,519 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-24 11:40:48,519 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-24 11:40:48,519 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,519 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2024-10-24 11:40:48,520 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2024-10-24 11:40:48,520 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,520 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2024-10-24 11:40:48,520 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2024-10-24 11:40:48,520 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2024-10-24 11:40:48,520 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2024-10-24 11:40:48,521 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2024-10-24 11:40:48,521 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2024-10-24 11:40:48,521 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,521 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2024-10-24 11:40:48,521 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2024-10-24 11:40:48,521 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,522 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-24 11:40:48,522 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-24 11:40:48,522 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,522 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-24 11:40:48,522 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-24 11:40:48,522 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,522 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset [2024-10-24 11:40:48,522 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset [2024-10-24 11:40:48,523 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2024-10-24 11:40:48,523 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2024-10-24 11:40:48,523 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-24 11:40:48,523 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-24 11:40:48,523 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,523 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-24 11:40:48,523 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-24 11:40:48,523 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,523 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2024-10-24 11:40:48,524 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2024-10-24 11:40:48,524 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,524 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-24 11:40:48,524 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-24 11:40:48,524 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,524 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2024-10-24 11:40:48,525 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2024-10-24 11:40:48,525 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,525 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-24 11:40:48,525 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-24 11:40:48,525 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,525 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2024-10-24 11:40:48,526 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2024-10-24 11:40:48,526 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base [2024-10-24 11:40:48,526 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base [2024-10-24 11:40:48,526 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-24 11:40:48,526 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-24 11:40:48,526 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,527 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2024-10-24 11:40:48,527 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2024-10-24 11:40:48,527 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,527 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2024-10-24 11:40:48,527 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2024-10-24 11:40:48,528 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,528 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-24 11:40:48,528 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-24 11:40:48,528 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,528 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2024-10-24 11:40:48,529 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2024-10-24 11:40:48,529 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,529 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-24 11:40:48,529 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-24 11:40:48,529 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,529 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2024-10-24 11:40:48,529 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2024-10-24 11:40:48,529 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,529 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2024-10-24 11:40:48,530 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2024-10-24 11:40:48,530 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2024-10-24 11:40:48,530 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2024-10-24 11:40:48,530 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-24 11:40:48,530 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-24 11:40:48,530 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,530 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-24 11:40:48,530 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-24 11:40:48,530 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,531 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset [2024-10-24 11:40:48,531 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset [2024-10-24 11:40:48,531 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-24 11:40:48,531 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-24 11:40:48,531 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,531 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2024-10-24 11:40:48,531 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2024-10-24 11:40:48,531 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,531 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2024-10-24 11:40:48,531 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2024-10-24 11:40:48,532 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2024-10-24 11:40:48,532 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2024-10-24 11:40:48,532 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base [2024-10-24 11:40:48,532 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base [2024-10-24 11:40:48,540 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2024-10-24 11:40:48,540 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2024-10-24 11:40:48,540 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2024-10-24 11:40:48,540 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2024-10-24 11:40:48,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-24 11:40:48,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-24 11:40:48,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-24 11:40:48,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-24 11:40:48,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset [2024-10-24 11:40:48,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset [2024-10-24 11:40:48,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2024-10-24 11:40:48,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2024-10-24 11:40:48,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2024-10-24 11:40:48,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2024-10-24 11:40:48,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base [2024-10-24 11:40:48,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base [2024-10-24 11:40:48,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2024-10-24 11:40:48,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2024-10-24 11:40:48,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2024-10-24 11:40:48,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2024-10-24 11:40:48,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-24 11:40:48,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-24 11:40:48,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-24 11:40:48,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-24 11:40:48,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-24 11:40:48,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset [2024-10-24 11:40:48,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset [2024-10-24 11:40:48,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2024-10-24 11:40:48,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2024-10-24 11:40:48,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2024-10-24 11:40:48,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2024-10-24 11:40:48,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base [2024-10-24 11:40:48,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base [2024-10-24 11:40:48,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:40:48 BoogieIcfgContainer [2024-10-24 11:40:48,554 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:40:48,555 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:40:48,555 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:40:48,555 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:40:48,556 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:40:04" (3/4) ... [2024-10-24 11:40:48,558 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 11:40:48,561 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 11:40:48,572 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 11:40:48,573 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-24 11:40:48,573 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 11:40:48,574 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 11:40:48,704 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 11:40:48,705 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 11:40:48,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:40:48,706 INFO L158 Benchmark]: Toolchain (without parser) took 45599.91ms. Allocated memory was 138.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 66.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2024-10-24 11:40:48,706 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 138.4MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:40:48,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.09ms. Allocated memory is still 138.4MB. Free memory was 66.2MB in the beginning and 51.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:40:48,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.36ms. Allocated memory is still 138.4MB. Free memory was 51.2MB in the beginning and 48.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:40:48,707 INFO L158 Benchmark]: Boogie Preprocessor took 86.36ms. Allocated memory is still 138.4MB. Free memory was 48.5MB in the beginning and 44.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:40:48,707 INFO L158 Benchmark]: RCFGBuilder took 769.09ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 44.9MB in the beginning and 127.1MB in the end (delta: -82.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 11:40:48,707 INFO L158 Benchmark]: TraceAbstraction took 44126.14ms. Allocated memory was 184.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 126.1MB in the beginning and 1.1GB in the end (delta: -955.6MB). Peak memory consumption was 694.8MB. Max. memory is 16.1GB. [2024-10-24 11:40:48,707 INFO L158 Benchmark]: Witness Printer took 150.24ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 11:40:48,709 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.24ms. Allocated memory is still 138.4MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.09ms. Allocated memory is still 138.4MB. Free memory was 66.2MB in the beginning and 51.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.36ms. Allocated memory is still 138.4MB. Free memory was 51.2MB in the beginning and 48.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.36ms. Allocated memory is still 138.4MB. Free memory was 48.5MB in the beginning and 44.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 769.09ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 44.9MB in the beginning and 127.1MB in the end (delta: -82.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 44126.14ms. Allocated memory was 184.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 126.1MB in the beginning and 1.1GB in the end (delta: -955.6MB). Peak memory consumption was 694.8MB. Max. memory is 16.1GB. * Witness Printer took 150.24ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base * 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: 19]: 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, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 29, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3305 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3305 mSDsluCounter, 12607 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9880 mSDsCounter, 323 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4212 IncrementalHoareTripleChecker+Invalid, 4535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 323 mSolverCounterUnsat, 2727 mSDtfsCounter, 4212 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1237 GetRequests, 955 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=14, InterpolantAutomatonStates: 217, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 1474 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 2422 NumberOfCodeBlocks, 2422 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2612 ConstructedInterpolants, 0 QuantifiedInterpolants, 11374 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1087 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 35 InterpolantComputations, 27 PerfectInterpolantSequences, 3702/3920 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: 105]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && ((((((((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_1_Pointer == \old(var_1_1_Pointer))) && (var_1_2 == \old(var_1_2))) && (var_1_2_Pointer == \old(var_1_2_Pointer))) && (var_1_3 == \old(var_1_3))) && (var_1_3_Pointer == \old(var_1_3_Pointer))) && (var_1_4 == \old(var_1_4))) && (var_1_4_Pointer == \old(var_1_4_Pointer))) && (var_1_5 == \old(var_1_5))) && (var_1_5_Pointer == \old(var_1_5_Pointer))) && (var_1_6 == \old(var_1_6))) && (var_1_6_Pointer == \old(var_1_6_Pointer))) && (var_1_7 == \old(var_1_7))) && (var_1_7_Pointer == \old(var_1_7_Pointer))) && (var_1_8 == \old(var_1_8))) && (var_1_8_Pointer == \old(var_1_8_Pointer))) && (var_1_9 == \old(var_1_9))) && (var_1_9_Pointer == \old(var_1_9_Pointer))) && (var_1_10 == \old(var_1_10))) && (var_1_10_Pointer == \old(var_1_10_Pointer))) && (last_1_var_1_1 == \old(last_1_var_1_1))) && (last_1_var_1_5 == \old(last_1_var_1_5))) && (last_1_var_1_10 == \old(last_1_var_1_10)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 11:40:48,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE