./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-a_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-a_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 e13ee54c81e57197c9e1d82387e2e01bbf563310cc95985b0138918208043d56 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:26:44,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:26:44,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:26:44,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:26:44,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:26:44,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:26:44,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:26:44,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:26:44,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:26:44,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:26:44,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:26:44,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:26:44,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:26:44,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:26:44,241 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:26:44,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:26:44,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:26:44,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:26:44,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:26:44,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:26:44,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:26:44,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:26:44,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:26:44,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:26:44,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:26:44,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:26:44,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:26:44,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:26:44,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:26:44,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:26:44,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:26:44,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:26:44,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:26:44,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:26:44,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:26:44,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:26:44,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:26:44,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:26:44,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:26:44,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:26:44,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:26:44,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:26:44,254 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 -> e13ee54c81e57197c9e1d82387e2e01bbf563310cc95985b0138918208043d56 [2024-10-14 13:26:44,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:26:44,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:26:44,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:26:44,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:26:44,482 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:26:44,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i [2024-10-14 13:26:45,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:26:45,941 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:26:45,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i [2024-10-14 13:26:45,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e62885f9e/1f4e46a13b254406b458dfcc11c87adc/FLAG5c448c11e [2024-10-14 13:26:45,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e62885f9e/1f4e46a13b254406b458dfcc11c87adc [2024-10-14 13:26:45,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:26:45,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:26:45,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:26:45,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:26:45,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:26:45,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:26:45" (1/1) ... [2024-10-14 13:26:45,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfd1f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:45, skipping insertion in model container [2024-10-14 13:26:45,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:26:45" (1/1) ... [2024-10-14 13:26:45,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:26:46,109 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-a_file-62.i[916,929] [2024-10-14 13:26:46,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:26:46,158 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:26:46,168 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-a_file-62.i[916,929] [2024-10-14 13:26:46,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:26:46,218 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:26:46,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46 WrapperNode [2024-10-14 13:26:46,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:26:46,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:26:46,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:26:46,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:26:46,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (1/1) ... [2024-10-14 13:26:46,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (1/1) ... [2024-10-14 13:26:46,264 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 330 [2024-10-14 13:26:46,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:26:46,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:26:46,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:26:46,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:26:46,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (1/1) ... [2024-10-14 13:26:46,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (1/1) ... [2024-10-14 13:26:46,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (1/1) ... [2024-10-14 13:26:46,290 INFO L175 MemorySlicer]: Split 87 memory accesses to 6 slices as follows [2, 10, 29, 26, 4, 16]. 33 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 3, 1, 2]. The 14 writes are split as follows [0, 1, 4, 6, 1, 2]. [2024-10-14 13:26:46,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (1/1) ... [2024-10-14 13:26:46,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (1/1) ... [2024-10-14 13:26:46,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (1/1) ... [2024-10-14 13:26:46,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (1/1) ... [2024-10-14 13:26:46,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (1/1) ... [2024-10-14 13:26:46,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (1/1) ... [2024-10-14 13:26:46,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:26:46,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:26:46,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:26:46,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:26:46,310 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (1/1) ... [2024-10-14 13:26:46,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:26:46,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:26:46,342 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-14 13:26:46,346 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-14 13:26:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:26:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:26:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:26:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:26:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:26:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:26:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:26:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:26:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:26:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:26:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:26:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:26:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:26:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:26:46,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:26:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:26:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:26:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:26:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:26:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:26:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:26:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:26:46,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:26:46,504 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:26:46,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:26:46,851 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-10-14 13:26:46,851 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:26:46,875 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:26:46,875 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:26:46,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:26:46 BoogieIcfgContainer [2024-10-14 13:26:46,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:26:46,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:26:46,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:26:46,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:26:46,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:26:45" (1/3) ... [2024-10-14 13:26:46,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271a82f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:26:46, skipping insertion in model container [2024-10-14 13:26:46,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:46" (2/3) ... [2024-10-14 13:26:46,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271a82f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:26:46, skipping insertion in model container [2024-10-14 13:26:46,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:26:46" (3/3) ... [2024-10-14 13:26:46,883 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-62.i [2024-10-14 13:26:46,894 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:26:46,895 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:26:46,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:26:46,958 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;@183d059e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:26:46,958 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:26:46,962 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-14 13:26:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 13:26:46,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:46,969 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-14 13:26:46,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:46,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1944691701, now seen corresponding path program 1 times [2024-10-14 13:26:46,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:46,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027939714] [2024-10-14 13:26:46,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:46,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,176 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-14 13:26:47,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:47,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027939714] [2024-10-14 13:26:47,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027939714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:47,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:47,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:26:47,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365100367] [2024-10-14 13:26:47,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:47,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:26:47,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:47,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:26:47,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:26:47,206 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-14 13:26:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:47,230 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2024-10-14 13:26:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:26:47,232 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-14 13:26:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:47,238 INFO L225 Difference]: With dead ends: 129 [2024-10-14 13:26:47,238 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 13:26:47,240 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-14 13:26:47,242 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-14 13:26:47,243 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-14 13:26:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 13:26:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 13:26:47,270 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-14 13:26:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2024-10-14 13:26:47,272 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2024-10-14 13:26:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:47,273 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2024-10-14 13:26:47,273 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-14 13:26:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2024-10-14 13:26:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 13:26:47,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:47,275 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-14 13:26:47,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:26:47,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:47,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2005151749, now seen corresponding path program 1 times [2024-10-14 13:26:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434598985] [2024-10-14 13:26:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,524 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-14 13:26:47,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:47,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434598985] [2024-10-14 13:26:47,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434598985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:47,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:47,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:26:47,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248741013] [2024-10-14 13:26:47,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:47,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:26:47,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:47,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:26:47,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:26:47,528 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-14 13:26:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:47,558 INFO L93 Difference]: Finished difference Result 130 states and 187 transitions. [2024-10-14 13:26:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:26:47,558 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-14 13:26:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:47,560 INFO L225 Difference]: With dead ends: 130 [2024-10-14 13:26:47,560 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 13:26:47,560 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-14 13:26:47,561 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-14 13:26:47,561 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-14 13:26:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 13:26:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-14 13:26:47,566 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-14 13:26:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2024-10-14 13:26:47,567 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 68 [2024-10-14 13:26:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:47,568 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2024-10-14 13:26:47,568 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-14 13:26:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2024-10-14 13:26:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 13:26:47,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:47,571 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-14 13:26:47,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:26:47,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:47,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1947893447, now seen corresponding path program 1 times [2024-10-14 13:26:47,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:47,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599489009] [2024-10-14 13:26:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:47,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:47,691 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-14 13:26:47,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:47,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599489009] [2024-10-14 13:26:47,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599489009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:47,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:47,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:26:47,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158014842] [2024-10-14 13:26:47,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:47,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:26:47,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:47,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:26:47,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:26:47,698 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-14 13:26:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:47,731 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2024-10-14 13:26:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:26:47,731 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-14 13:26:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:47,733 INFO L225 Difference]: With dead ends: 134 [2024-10-14 13:26:47,733 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 13:26:47,733 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-14 13:26:47,734 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-14 13:26:47,735 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-14 13:26:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 13:26:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-14 13:26:47,743 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-14 13:26:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-14 13:26:47,744 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 68 [2024-10-14 13:26:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:47,744 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-14 13:26:47,744 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-14 13:26:47,745 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-14 13:26:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 13:26:47,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:47,749 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-14 13:26:47,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:26:47,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:47,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:47,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1947833865, now seen corresponding path program 1 times [2024-10-14 13:26:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:47,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020714738] [2024-10-14 13:26:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,048 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-14 13:26:48,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:48,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020714738] [2024-10-14 13:26:48,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020714738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:48,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:48,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:26:48,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161424584] [2024-10-14 13:26:48,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:48,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:26:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:48,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:26:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:26:48,052 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-14 13:26:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:48,136 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2024-10-14 13:26:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:26:48,136 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-14 13:26:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:48,139 INFO L225 Difference]: With dead ends: 160 [2024-10-14 13:26:48,139 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 13:26:48,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-14 13:26:48,140 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 84 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:48,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 225 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 13:26:48,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2024-10-14 13:26:48,145 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-14 13:26:48,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2024-10-14 13:26:48,146 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 68 [2024-10-14 13:26:48,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:48,146 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2024-10-14 13:26:48,146 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-14 13:26:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2024-10-14 13:26:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 13:26:48,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:48,147 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-14 13:26:48,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:26:48,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:48,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:48,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1661631908, now seen corresponding path program 1 times [2024-10-14 13:26:48,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:48,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900988772] [2024-10-14 13:26:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,381 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-14 13:26:48,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:48,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900988772] [2024-10-14 13:26:48,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900988772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:48,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:48,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:26:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836364973] [2024-10-14 13:26:48,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:48,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:26:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:48,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:26:48,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:26:48,384 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-14 13:26:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:48,526 INFO L93 Difference]: Finished difference Result 205 states and 287 transitions. [2024-10-14 13:26:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:26:48,526 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-14 13:26:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:48,528 INFO L225 Difference]: With dead ends: 205 [2024-10-14 13:26:48,528 INFO L226 Difference]: Without dead ends: 138 [2024-10-14 13:26:48,528 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-14 13:26:48,529 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 85 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:48,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 564 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-14 13:26:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 78. [2024-10-14 13:26:48,541 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-14 13:26:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-10-14 13:26:48,545 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 70 [2024-10-14 13:26:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:48,546 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-10-14 13:26:48,546 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-14 13:26:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2024-10-14 13:26:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 13:26:48,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:48,547 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-14 13:26:48,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:26:48,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:48,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1362359734, now seen corresponding path program 1 times [2024-10-14 13:26:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:48,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590404165] [2024-10-14 13:26:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,771 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-14 13:26:48,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:48,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590404165] [2024-10-14 13:26:48,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590404165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:48,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:48,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:26:48,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541835699] [2024-10-14 13:26:48,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:48,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:26:48,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:48,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:26:48,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:26:48,773 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-14 13:26:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:48,836 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2024-10-14 13:26:48,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:26:48,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 72 [2024-10-14 13:26:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:48,838 INFO L225 Difference]: With dead ends: 188 [2024-10-14 13:26:48,838 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 13:26:48,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-14 13:26:48,839 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:48,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 514 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 13:26:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2024-10-14 13:26:48,843 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-14 13:26:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-10-14 13:26:48,843 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 72 [2024-10-14 13:26:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:48,844 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-10-14 13:26:48,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-14 13:26:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-10-14 13:26:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 13:26:48,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:48,845 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-14 13:26:48,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:26:48,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:48,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:48,845 INFO L85 PathProgramCache]: Analyzing trace with hash -686157583, now seen corresponding path program 1 times [2024-10-14 13:26:48,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:48,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528708500] [2024-10-14 13:26:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:48,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:48,930 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-14 13:26:48,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:48,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528708500] [2024-10-14 13:26:48,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528708500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:48,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:48,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:26:48,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129353678] [2024-10-14 13:26:48,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:48,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:26:48,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:48,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:26:48,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:26:48,932 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-14 13:26:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:48,957 INFO L93 Difference]: Finished difference Result 158 states and 219 transitions. [2024-10-14 13:26:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:26:48,957 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-14 13:26:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:48,958 INFO L225 Difference]: With dead ends: 158 [2024-10-14 13:26:48,958 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 13:26:48,958 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-14 13:26:48,959 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-14 13:26:48,959 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-14 13:26:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 13:26:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-14 13:26:48,962 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-14 13:26:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2024-10-14 13:26:48,963 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 72 [2024-10-14 13:26:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:48,963 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2024-10-14 13:26:48,963 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-14 13:26:48,963 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2024-10-14 13:26:48,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 13:26:48,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:48,964 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-14 13:26:48,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:26:48,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:48,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1885600574, now seen corresponding path program 1 times [2024-10-14 13:26:48,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:48,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299467507] [2024-10-14 13:26:48,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:48,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,129 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-14 13:26:49,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:49,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299467507] [2024-10-14 13:26:49,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299467507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:49,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:49,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:26:49,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338968495] [2024-10-14 13:26:49,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:49,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:26:49,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:49,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:26:49,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:26:49,131 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-14 13:26:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:49,188 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2024-10-14 13:26:49,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:26:49,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 72 [2024-10-14 13:26:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:49,190 INFO L225 Difference]: With dead ends: 192 [2024-10-14 13:26:49,190 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 13:26:49,190 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-14 13:26:49,190 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:49,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 417 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 13:26:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2024-10-14 13:26:49,194 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-14 13:26:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2024-10-14 13:26:49,194 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 72 [2024-10-14 13:26:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:49,195 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2024-10-14 13:26:49,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-14 13:26:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2024-10-14 13:26:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 13:26:49,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:49,196 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-14 13:26:49,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:26:49,196 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:49,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:49,196 INFO L85 PathProgramCache]: Analyzing trace with hash 772475292, now seen corresponding path program 1 times [2024-10-14 13:26:49,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:49,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627070761] [2024-10-14 13:26:49,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:49,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-14 13:26:49,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:49,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627070761] [2024-10-14 13:26:49,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627070761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:26:49,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735392753] [2024-10-14 13:26:49,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:49,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:26:49,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:26:49,461 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-14 13:26:49,465 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-14 13:26:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:49,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 13:26:49,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:26:49,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-14 13:26:49,681 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 7 [2024-10-14 13:26:49,702 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-14 13:26:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 13:26:49,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:26:49,750 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 23 treesize of output 15 [2024-10-14 13:26:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-14 13:26:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735392753] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:26:49,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:26:49,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-10-14 13:26:49,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953935256] [2024-10-14 13:26:49,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:26:49,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 13:26:49,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:49,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 13:26:49,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-14 13:26:49,885 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 18 states have internal predecessors, (65), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-14 13:26:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:50,294 INFO L93 Difference]: Finished difference Result 222 states and 291 transitions. [2024-10-14 13:26:50,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 13:26:50,294 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 18 states have internal predecessors, (65), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 6 states have call successors, (16) Word has length 74 [2024-10-14 13:26:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:50,295 INFO L225 Difference]: With dead ends: 222 [2024-10-14 13:26:50,295 INFO L226 Difference]: Without dead ends: 142 [2024-10-14 13:26:50,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2024-10-14 13:26:50,296 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 349 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:50,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 576 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:26:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-14 13:26:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2024-10-14 13:26:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 121 states have (on average 1.28099173553719) internal successors, (155), 122 states have internal predecessors, (155), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 13:26:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2024-10-14 13:26:50,302 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 74 [2024-10-14 13:26:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:50,303 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2024-10-14 13:26:50,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 18 states have internal predecessors, (65), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-14 13:26:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2024-10-14 13:26:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 13:26:50,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:50,304 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-14 13:26:50,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 13:26:50,504 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-14 13:26:50,504 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:50,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash -238641958, now seen corresponding path program 1 times [2024-10-14 13:26:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:50,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313733336] [2024-10-14 13:26:50,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:50,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:50,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:50,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:50,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:50,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:50,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:50,702 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-14 13:26:50,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:50,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313733336] [2024-10-14 13:26:50,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313733336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:50,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:50,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:26:50,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603790823] [2024-10-14 13:26:50,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:50,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:26:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:50,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:26:50,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:26:50,704 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 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-14 13:26:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:50,807 INFO L93 Difference]: Finished difference Result 325 states and 420 transitions. [2024-10-14 13:26:50,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:26:50,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 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 74 [2024-10-14 13:26:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:50,809 INFO L225 Difference]: With dead ends: 325 [2024-10-14 13:26:50,809 INFO L226 Difference]: Without dead ends: 187 [2024-10-14 13:26:50,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:26:50,810 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 53 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:50,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 529 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:50,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-14 13:26:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 144. [2024-10-14 13:26:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.2769230769230768) internal successors, (166), 131 states have internal predecessors, (166), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 13:26:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2024-10-14 13:26:50,816 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 74 [2024-10-14 13:26:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:50,816 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2024-10-14 13:26:50,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 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-14 13:26:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2024-10-14 13:26:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 13:26:50,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:50,817 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-14 13:26:50,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 13:26:50,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:50,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:50,818 INFO L85 PathProgramCache]: Analyzing trace with hash 184059868, now seen corresponding path program 1 times [2024-10-14 13:26:50,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:50,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089460930] [2024-10-14 13:26:50,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:50,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:51,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:51,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:51,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:51,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:51,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:51,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:51,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-14 13:26:51,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:51,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089460930] [2024-10-14 13:26:51,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089460930] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:26:51,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541892544] [2024-10-14 13:26:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:51,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:26:51,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:26:51,222 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-14 13:26:51,223 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-14 13:26:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:51,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 13:26:51,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:26:51,329 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-14 13:26:51,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-14 13:26:51,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 13:26:51,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 13:26:51,512 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 7 [2024-10-14 13:26:51,515 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-14 13:26:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 81 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 13:26:51,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:26:51,667 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 23 treesize of output 11 [2024-10-14 13:26:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-14 13:26:51,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541892544] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:26:51,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:26:51,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2024-10-14 13:26:51,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110483700] [2024-10-14 13:26:51,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:26:51,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 13:26:51,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:51,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 13:26:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2024-10-14 13:26:51,696 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand has 23 states, 20 states have (on average 4.15) internal successors, (83), 23 states have internal predecessors, (83), 10 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 10 states have call successors, (22) [2024-10-14 13:26:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:52,578 INFO L93 Difference]: Finished difference Result 719 states and 925 transitions. [2024-10-14 13:26:52,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-14 13:26:52,578 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 4.15) internal successors, (83), 23 states have internal predecessors, (83), 10 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 10 states have call successors, (22) Word has length 74 [2024-10-14 13:26:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:52,580 INFO L225 Difference]: With dead ends: 719 [2024-10-14 13:26:52,581 INFO L226 Difference]: Without dead ends: 576 [2024-10-14 13:26:52,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 13:26:52,582 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1965 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1970 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:52,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1970 Valid, 480 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:26:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-14 13:26:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 297. [2024-10-14 13:26:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 270 states have (on average 1.2814814814814814) internal successors, (346), 272 states have internal predecessors, (346), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:26:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 386 transitions. [2024-10-14 13:26:52,595 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 386 transitions. Word has length 74 [2024-10-14 13:26:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:52,595 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 386 transitions. [2024-10-14 13:26:52,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 4.15) internal successors, (83), 23 states have internal predecessors, (83), 10 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 10 states have call successors, (22) [2024-10-14 13:26:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-10-14 13:26:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:26:52,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:52,597 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-14 13:26:52,612 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-14 13:26:52,800 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,SelfDestructingSolverStorable10 [2024-10-14 13:26:52,801 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:52,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:52,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1615265287, now seen corresponding path program 1 times [2024-10-14 13:26:52,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:52,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769414189] [2024-10-14 13:26:52,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:52,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,371 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-14 13:26:53,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:53,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769414189] [2024-10-14 13:26:53,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769414189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:53,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:53,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 13:26:53,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983246505] [2024-10-14 13:26:53,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:53,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 13:26:53,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:53,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 13:26:53,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:26:53,373 INFO L87 Difference]: Start difference. First operand 297 states and 386 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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-14 13:26:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:53,693 INFO L93 Difference]: Finished difference Result 677 states and 878 transitions. [2024-10-14 13:26:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:26:53,693 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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 75 [2024-10-14 13:26:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:53,695 INFO L225 Difference]: With dead ends: 677 [2024-10-14 13:26:53,695 INFO L226 Difference]: Without dead ends: 381 [2024-10-14 13:26:53,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-10-14 13:26:53,695 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 122 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:53,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 855 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:26:53,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-14 13:26:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 299. [2024-10-14 13:26:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 272 states have (on average 1.2794117647058822) internal successors, (348), 274 states have internal predecessors, (348), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:26:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 388 transitions. [2024-10-14 13:26:53,707 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 388 transitions. Word has length 75 [2024-10-14 13:26:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:53,707 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 388 transitions. [2024-10-14 13:26:53,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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-14 13:26:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 388 transitions. [2024-10-14 13:26:53,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:26:53,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:53,709 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-14 13:26:53,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 13:26:53,709 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:53,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:53,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1396410569, now seen corresponding path program 1 times [2024-10-14 13:26:53,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:53,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626069605] [2024-10-14 13:26:53,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:53,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,892 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-14 13:26:53,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:53,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626069605] [2024-10-14 13:26:53,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626069605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:53,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:53,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:26:53,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217474536] [2024-10-14 13:26:53,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:53,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:26:53,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:53,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:26:53,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:26:53,893 INFO L87 Difference]: Start difference. First operand 299 states and 388 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 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-14 13:26:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:54,011 INFO L93 Difference]: Finished difference Result 745 states and 966 transitions. [2024-10-14 13:26:54,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:26:54,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 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 75 [2024-10-14 13:26:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:54,014 INFO L225 Difference]: With dead ends: 745 [2024-10-14 13:26:54,014 INFO L226 Difference]: Without dead ends: 447 [2024-10-14 13:26:54,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:26:54,015 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 51 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:54,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 573 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-14 13:26:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 277. [2024-10-14 13:26:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 250 states have (on average 1.268) internal successors, (317), 252 states have internal predecessors, (317), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:26:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 357 transitions. [2024-10-14 13:26:54,027 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 357 transitions. Word has length 75 [2024-10-14 13:26:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:54,027 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 357 transitions. [2024-10-14 13:26:54,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 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-14 13:26:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 357 transitions. [2024-10-14 13:26:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:26:54,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:54,028 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-14 13:26:54,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 13:26:54,028 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:54,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:54,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1887439477, now seen corresponding path program 1 times [2024-10-14 13:26:54,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:54,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188001886] [2024-10-14 13:26:54,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:54,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,629 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-14 13:26:54,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:54,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188001886] [2024-10-14 13:26:54,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188001886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:54,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:54,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-14 13:26:54,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73262596] [2024-10-14 13:26:54,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:54,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 13:26:54,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:54,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 13:26:54,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-14 13:26:54,631 INFO L87 Difference]: Start difference. First operand 277 states and 357 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 13:26:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:55,400 INFO L93 Difference]: Finished difference Result 836 states and 1062 transitions. [2024-10-14 13:26:55,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 13:26:55,400 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2024-10-14 13:26:55,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:55,402 INFO L225 Difference]: With dead ends: 836 [2024-10-14 13:26:55,402 INFO L226 Difference]: Without dead ends: 560 [2024-10-14 13:26:55,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1148, Unknown=0, NotChecked=0, Total=1406 [2024-10-14 13:26:55,403 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 735 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:55,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1062 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:26:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-14 13:26:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 291. [2024-10-14 13:26:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 264 states have (on average 1.2651515151515151) internal successors, (334), 266 states have internal predecessors, (334), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:26:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 374 transitions. [2024-10-14 13:26:55,415 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 374 transitions. Word has length 75 [2024-10-14 13:26:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:55,415 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 374 transitions. [2024-10-14 13:26:55,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 13:26:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 374 transitions. [2024-10-14 13:26:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:26:55,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:55,416 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-14 13:26:55,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 13:26:55,417 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:55,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash -292261228, now seen corresponding path program 1 times [2024-10-14 13:26:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:55,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720166774] [2024-10-14 13:26:55,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:55,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,486 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-14 13:26:55,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720166774] [2024-10-14 13:26:55,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720166774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:55,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:55,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:26:55,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111621592] [2024-10-14 13:26:55,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:55,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:26:55,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:55,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:26:55,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:26:55,488 INFO L87 Difference]: Start difference. First operand 291 states and 374 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-14 13:26:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:55,521 INFO L93 Difference]: Finished difference Result 597 states and 767 transitions. [2024-10-14 13:26:55,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:26:55,522 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-14 13:26:55,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:55,523 INFO L225 Difference]: With dead ends: 597 [2024-10-14 13:26:55,523 INFO L226 Difference]: Without dead ends: 307 [2024-10-14 13:26:55,523 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-14 13:26:55,523 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 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-14 13:26:55,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:55,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-14 13:26:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 295. [2024-10-14 13:26:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 268 states have (on average 1.2611940298507462) internal successors, (338), 270 states have internal predecessors, (338), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:26:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 378 transitions. [2024-10-14 13:26:55,534 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 378 transitions. Word has length 75 [2024-10-14 13:26:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:55,534 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 378 transitions. [2024-10-14 13:26:55,535 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-14 13:26:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 378 transitions. [2024-10-14 13:26:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:26:55,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:55,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, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:26:55,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 13:26:55,536 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1154154267, now seen corresponding path program 1 times [2024-10-14 13:26:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:55,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490871157] [2024-10-14 13:26:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:55,623 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-14 13:26:55,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:55,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490871157] [2024-10-14 13:26:55,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490871157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:55,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:55,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:26:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371969838] [2024-10-14 13:26:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:26:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:55,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:26:55,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:26:55,624 INFO L87 Difference]: Start difference. First operand 295 states and 378 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-14 13:26:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:55,700 INFO L93 Difference]: Finished difference Result 597 states and 761 transitions. [2024-10-14 13:26:55,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:26:55,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-14 13:26:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:55,702 INFO L225 Difference]: With dead ends: 597 [2024-10-14 13:26:55,702 INFO L226 Difference]: Without dead ends: 303 [2024-10-14 13:26:55,702 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-14 13:26:55,703 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 49 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:55,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 197 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-14 13:26:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 213. [2024-10-14 13:26:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 190 states have (on average 1.2421052631578948) internal successors, (236), 190 states have internal predecessors, (236), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:26:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 268 transitions. [2024-10-14 13:26:55,712 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 268 transitions. Word has length 75 [2024-10-14 13:26:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:55,713 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 268 transitions. [2024-10-14 13:26:55,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-14 13:26:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 268 transitions. [2024-10-14 13:26:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 13:26:55,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:55,714 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-14 13:26:55,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 13:26:55,714 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:55,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:55,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1636270173, now seen corresponding path program 1 times [2024-10-14 13:26:55,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:55,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988097064] [2024-10-14 13:26:55,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:55,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,387 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-14 13:26:56,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:56,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988097064] [2024-10-14 13:26:56,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988097064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:26:56,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375084564] [2024-10-14 13:26:56,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:56,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:26:56,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:26:56,392 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-14 13:26:56,394 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-14 13:26:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 13:26:56,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:26:56,502 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 19 treesize of output 1 [2024-10-14 13:26:56,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2024-10-14 13:26:56,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:26:56,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 32 [2024-10-14 13:26:56,724 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-14 13:26:56,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:26:56,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375084564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:56,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:26:56,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 26 [2024-10-14 13:26:56,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275281100] [2024-10-14 13:26:56,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:56,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:26:56,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:56,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:26:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2024-10-14 13:26:56,726 INFO L87 Difference]: Start difference. First operand 213 states and 268 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-14 13:26:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:56,944 INFO L93 Difference]: Finished difference Result 511 states and 640 transitions. [2024-10-14 13:26:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:26:56,944 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-14 13:26:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:56,945 INFO L225 Difference]: With dead ends: 511 [2024-10-14 13:26:56,946 INFO L226 Difference]: Without dead ends: 299 [2024-10-14 13:26:56,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2024-10-14 13:26:56,947 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 49 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:56,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 795 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-14 13:26:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 96. [2024-10-14 13:26:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 84 states have internal predecessors, (104), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:26:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2024-10-14 13:26:56,956 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 76 [2024-10-14 13:26:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:56,956 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2024-10-14 13:26:56,956 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-14 13:26:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2024-10-14 13:26:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 13:26:56,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:56,958 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-14 13:26:56,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 13:26:57,158 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-14 13:26:57,159 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:57,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:57,159 INFO L85 PathProgramCache]: Analyzing trace with hash 63343981, now seen corresponding path program 1 times [2024-10-14 13:26:57,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:57,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194300475] [2024-10-14 13:26:57,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:57,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,321 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-14 13:26:57,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:57,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194300475] [2024-10-14 13:26:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194300475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:57,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:57,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:26:57,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939086736] [2024-10-14 13:26:57,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:57,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:26:57,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:57,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:26:57,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:26:57,323 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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-14 13:26:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:57,375 INFO L93 Difference]: Finished difference Result 226 states and 282 transitions. [2024-10-14 13:26:57,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:26:57,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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 77 [2024-10-14 13:26:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:57,376 INFO L225 Difference]: With dead ends: 226 [2024-10-14 13:26:57,376 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 13:26:57,376 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-14 13:26:57,376 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 41 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:57,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 366 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:57,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 13:26:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2024-10-14 13:26:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:26:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2024-10-14 13:26:57,382 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 77 [2024-10-14 13:26:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:57,382 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2024-10-14 13:26:57,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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-14 13:26:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2024-10-14 13:26:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 13:26:57,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:57,383 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-14 13:26:57,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 13:26:57,384 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:57,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:57,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1702671271, now seen corresponding path program 1 times [2024-10-14 13:26:57,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:57,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084728047] [2024-10-14 13:26:57,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:57,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,513 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-14 13:26:57,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:57,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084728047] [2024-10-14 13:26:57,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084728047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:57,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:57,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:26:57,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847718239] [2024-10-14 13:26:57,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:57,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:26:57,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:57,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:26:57,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:26:57,515 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-14 13:26:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:57,566 INFO L93 Difference]: Finished difference Result 222 states and 276 transitions. [2024-10-14 13:26:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:26:57,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 78 [2024-10-14 13:26:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:57,567 INFO L225 Difference]: With dead ends: 222 [2024-10-14 13:26:57,567 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 13:26:57,567 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-14 13:26:57,568 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:57,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 366 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 13:26:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 101. [2024-10-14 13:26:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 89 states have internal predecessors, (108), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:26:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2024-10-14 13:26:57,574 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 78 [2024-10-14 13:26:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:57,574 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2024-10-14 13:26:57,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-14 13:26:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2024-10-14 13:26:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 13:26:57,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:57,575 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-14 13:26:57,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 13:26:57,575 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:57,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2094073389, now seen corresponding path program 1 times [2024-10-14 13:26:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483799137] [2024-10-14 13:26:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,777 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-14 13:26:57,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483799137] [2024-10-14 13:26:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483799137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:57,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:57,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:26:57,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668225803] [2024-10-14 13:26:57,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:57,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:26:57,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:57,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:26:57,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:26:57,779 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-14 13:26:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:57,869 INFO L93 Difference]: Finished difference Result 280 states and 338 transitions. [2024-10-14 13:26:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 13:26:57,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-14 13:26:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:57,872 INFO L225 Difference]: With dead ends: 280 [2024-10-14 13:26:57,873 INFO L226 Difference]: Without dead ends: 180 [2024-10-14 13:26:57,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:26:57,873 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 53 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:57,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 582 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-14 13:26:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 169. [2024-10-14 13:26:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 148 states have (on average 1.1824324324324325) internal successors, (175), 149 states have internal predecessors, (175), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 13:26:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 203 transitions. [2024-10-14 13:26:57,885 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 203 transitions. Word has length 78 [2024-10-14 13:26:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:57,885 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 203 transitions. [2024-10-14 13:26:57,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-14 13:26:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 203 transitions. [2024-10-14 13:26:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 13:26:57,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:57,886 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-14 13:26:57,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 13:26:57,886 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:57,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1875218671, now seen corresponding path program 1 times [2024-10-14 13:26:57,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:57,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581268991] [2024-10-14 13:26:57,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,945 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-14 13:26:57,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:57,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581268991] [2024-10-14 13:26:57,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581268991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:57,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:57,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:26:57,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091512186] [2024-10-14 13:26:57,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:57,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:26:57,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:57,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:26:57,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:26:57,946 INFO L87 Difference]: Start difference. First operand 169 states and 203 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-14 13:26:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:58,024 INFO L93 Difference]: Finished difference Result 383 states and 459 transitions. [2024-10-14 13:26:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:26:58,024 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-14 13:26:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:58,026 INFO L225 Difference]: With dead ends: 383 [2024-10-14 13:26:58,026 INFO L226 Difference]: Without dead ends: 215 [2024-10-14 13:26:58,026 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-14 13:26:58,027 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 41 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:58,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 388 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-14 13:26:58,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 184. [2024-10-14 13:26:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 163 states have (on average 1.1717791411042944) internal successors, (191), 164 states have internal predecessors, (191), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 13:26:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 219 transitions. [2024-10-14 13:26:58,038 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 219 transitions. Word has length 78 [2024-10-14 13:26:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:58,038 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 219 transitions. [2024-10-14 13:26:58,039 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-14 13:26:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 219 transitions. [2024-10-14 13:26:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 13:26:58,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:58,039 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-14 13:26:58,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 13:26:58,039 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:58,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:58,040 INFO L85 PathProgramCache]: Analyzing trace with hash -606322452, now seen corresponding path program 1 times [2024-10-14 13:26:58,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:58,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880436069] [2024-10-14 13:26:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:58,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,560 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-14 13:26:58,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:58,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880436069] [2024-10-14 13:26:58,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880436069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:58,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:58,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:26:58,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724277240] [2024-10-14 13:26:58,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:58,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:26:58,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:58,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:26:58,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:26:58,562 INFO L87 Difference]: Start difference. First operand 184 states and 219 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-14 13:26:58,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:58,659 INFO L93 Difference]: Finished difference Result 226 states and 269 transitions. [2024-10-14 13:26:58,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:26:58,659 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-14 13:26:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:58,660 INFO L225 Difference]: With dead ends: 226 [2024-10-14 13:26:58,660 INFO L226 Difference]: Without dead ends: 224 [2024-10-14 13:26:58,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:26:58,661 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 59 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:58,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 324 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-14 13:26:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2024-10-14 13:26:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 187 states have (on average 1.1497326203208555) internal successors, (215), 189 states have internal predecessors, (215), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:26:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 259 transitions. [2024-10-14 13:26:58,680 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 259 transitions. Word has length 80 [2024-10-14 13:26:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:58,681 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 259 transitions. [2024-10-14 13:26:58,681 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-14 13:26:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 259 transitions. [2024-10-14 13:26:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 13:26:58,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:58,681 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-14 13:26:58,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 13:26:58,682 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:58,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:58,682 INFO L85 PathProgramCache]: Analyzing trace with hash -606262870, now seen corresponding path program 1 times [2024-10-14 13:26:58,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:58,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307600963] [2024-10-14 13:26:58,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:58,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:58,778 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-14 13:26:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307600963] [2024-10-14 13:26:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307600963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:58,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:58,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:26:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482547887] [2024-10-14 13:26:58,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:58,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:26:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:58,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:26:58,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:26:58,780 INFO L87 Difference]: Start difference. First operand 220 states and 259 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-14 13:26:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:58,848 INFO L93 Difference]: Finished difference Result 415 states and 487 transitions. [2024-10-14 13:26:58,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:26:58,848 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-14 13:26:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:58,849 INFO L225 Difference]: With dead ends: 415 [2024-10-14 13:26:58,849 INFO L226 Difference]: Without dead ends: 228 [2024-10-14 13:26:58,850 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-14 13:26:58,850 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 42 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:58,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 296 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-14 13:26:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-10-14 13:26:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 193 states have (on average 1.1347150259067358) internal successors, (219), 195 states have internal predecessors, (219), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:26:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 263 transitions. [2024-10-14 13:26:58,870 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 263 transitions. Word has length 80 [2024-10-14 13:26:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:58,871 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 263 transitions. [2024-10-14 13:26:58,871 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-14 13:26:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 263 transitions. [2024-10-14 13:26:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 13:26:58,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:58,872 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-14 13:26:58,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 13:26:58,872 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:58,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash -549004568, now seen corresponding path program 1 times [2024-10-14 13:26:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:58,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556308400] [2024-10-14 13:26:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,303 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-14 13:26:59,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:59,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556308400] [2024-10-14 13:26:59,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556308400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:59,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:59,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:26:59,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376617436] [2024-10-14 13:26:59,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:59,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:26:59,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:59,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:26:59,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:26:59,305 INFO L87 Difference]: Start difference. First operand 228 states and 263 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 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-14 13:26:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:59,481 INFO L93 Difference]: Finished difference Result 564 states and 653 transitions. [2024-10-14 13:26:59,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 13:26:59,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 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 80 [2024-10-14 13:26:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:59,483 INFO L225 Difference]: With dead ends: 564 [2024-10-14 13:26:59,483 INFO L226 Difference]: Without dead ends: 369 [2024-10-14 13:26:59,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:26:59,483 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 99 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:59,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 480 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-14 13:26:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 329. [2024-10-14 13:26:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 294 states have (on average 1.1394557823129252) internal successors, (335), 296 states have internal predecessors, (335), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:26:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 379 transitions. [2024-10-14 13:26:59,505 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 379 transitions. Word has length 80 [2024-10-14 13:26:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:59,505 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 379 transitions. [2024-10-14 13:26:59,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 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-14 13:26:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 379 transitions. [2024-10-14 13:26:59,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 13:26:59,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:59,506 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-14 13:26:59,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 13:26:59,506 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:59,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:59,506 INFO L85 PathProgramCache]: Analyzing trace with hash 847893285, now seen corresponding path program 1 times [2024-10-14 13:26:59,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:59,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923448801] [2024-10-14 13:26:59,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:59,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,624 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-14 13:26:59,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:59,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923448801] [2024-10-14 13:26:59,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923448801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:59,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:59,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:26:59,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296890178] [2024-10-14 13:26:59,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:59,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:26:59,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:59,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:26:59,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:26:59,625 INFO L87 Difference]: Start difference. First operand 329 states and 379 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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-14 13:26:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:59,691 INFO L93 Difference]: Finished difference Result 673 states and 776 transitions. [2024-10-14 13:26:59,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:26:59,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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 81 [2024-10-14 13:26:59,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:59,693 INFO L225 Difference]: With dead ends: 673 [2024-10-14 13:26:59,693 INFO L226 Difference]: Without dead ends: 377 [2024-10-14 13:26:59,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-14 13:26:59,693 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 62 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:59,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 378 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-10-14 13:26:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 287. [2024-10-14 13:26:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 252 states have (on average 1.123015873015873) internal successors, (283), 254 states have internal predecessors, (283), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:26:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 327 transitions. [2024-10-14 13:26:59,714 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 327 transitions. Word has length 81 [2024-10-14 13:26:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:59,714 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 327 transitions. [2024-10-14 13:26:59,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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-14 13:26:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 327 transitions. [2024-10-14 13:26:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 13:26:59,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:59,715 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-14 13:26:59,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 13:26:59,715 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:59,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:59,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1067300445, now seen corresponding path program 1 times [2024-10-14 13:26:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:59,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369118335] [2024-10-14 13:26:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:59,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:59,918 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-14 13:26:59,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:59,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369118335] [2024-10-14 13:26:59,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369118335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:59,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:59,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:26:59,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66250958] [2024-10-14 13:26:59,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:59,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:26:59,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:59,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:26:59,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:26:59,920 INFO L87 Difference]: Start difference. First operand 287 states and 327 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-14 13:27:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:00,038 INFO L93 Difference]: Finished difference Result 634 states and 720 transitions. [2024-10-14 13:27:00,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:27:00,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-14 13:27:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:00,040 INFO L225 Difference]: With dead ends: 634 [2024-10-14 13:27:00,040 INFO L226 Difference]: Without dead ends: 380 [2024-10-14 13:27:00,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:27:00,041 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:00,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 260 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:27:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-14 13:27:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 362. [2024-10-14 13:27:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 327 states have (on average 1.1192660550458715) internal successors, (366), 329 states have internal predecessors, (366), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:27:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 410 transitions. [2024-10-14 13:27:00,061 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 410 transitions. Word has length 82 [2024-10-14 13:27:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:00,061 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 410 transitions. [2024-10-14 13:27:00,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-14 13:27:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 410 transitions. [2024-10-14 13:27:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 13:27:00,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:00,062 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-14 13:27:00,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 13:27:00,063 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:00,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:00,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1832706834, now seen corresponding path program 1 times [2024-10-14 13:27:00,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:00,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549431860] [2024-10-14 13:27:00,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:00,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,133 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-14 13:27:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:00,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549431860] [2024-10-14 13:27:00,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549431860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:00,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:00,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:27:00,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629238586] [2024-10-14 13:27:00,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:00,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:27:00,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:00,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:27:00,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:27:00,135 INFO L87 Difference]: Start difference. First operand 362 states and 410 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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-14 13:27:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:00,197 INFO L93 Difference]: Finished difference Result 615 states and 696 transitions. [2024-10-14 13:27:00,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:27:00,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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 82 [2024-10-14 13:27:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:00,198 INFO L225 Difference]: With dead ends: 615 [2024-10-14 13:27:00,198 INFO L226 Difference]: Without dead ends: 286 [2024-10-14 13:27:00,198 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-14 13:27:00,199 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:00,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 259 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:27:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-14 13:27:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-10-14 13:27:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 251 states have (on average 1.1075697211155378) internal successors, (278), 253 states have internal predecessors, (278), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:27:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 322 transitions. [2024-10-14 13:27:00,218 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 322 transitions. Word has length 82 [2024-10-14 13:27:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:00,219 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 322 transitions. [2024-10-14 13:27:00,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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-14 13:27:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 322 transitions. [2024-10-14 13:27:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 13:27:00,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:00,220 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-14 13:27:00,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 13:27:00,220 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:00,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:00,220 INFO L85 PathProgramCache]: Analyzing trace with hash -10337099, now seen corresponding path program 1 times [2024-10-14 13:27:00,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:00,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189752666] [2024-10-14 13:27:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:00,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,614 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-14 13:27:00,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:00,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189752666] [2024-10-14 13:27:00,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189752666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:00,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:00,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:27:00,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928520745] [2024-10-14 13:27:00,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:00,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:27:00,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:00,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:27:00,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:27:00,615 INFO L87 Difference]: Start difference. First operand 286 states and 322 transitions. Second operand has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 13:27:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:00,744 INFO L93 Difference]: Finished difference Result 547 states and 617 transitions. [2024-10-14 13:27:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:27:00,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2024-10-14 13:27:00,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:00,745 INFO L225 Difference]: With dead ends: 547 [2024-10-14 13:27:00,746 INFO L226 Difference]: Without dead ends: 294 [2024-10-14 13:27:00,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:27:00,746 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 35 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:00,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 454 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:27:00,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-14 13:27:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 288. [2024-10-14 13:27:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 253 states have (on average 1.1067193675889329) internal successors, (280), 255 states have internal predecessors, (280), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:27:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 324 transitions. [2024-10-14 13:27:00,766 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 324 transitions. Word has length 83 [2024-10-14 13:27:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:00,766 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 324 transitions. [2024-10-14 13:27:00,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 13:27:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 324 transitions. [2024-10-14 13:27:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 13:27:00,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:00,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, 1, 1, 1, 1, 1] [2024-10-14 13:27:00,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 13:27:00,767 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:00,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:00,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1104038769, now seen corresponding path program 1 times [2024-10-14 13:27:00,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:00,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589819820] [2024-10-14 13:27:00,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:00,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,839 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-14 13:27:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589819820] [2024-10-14 13:27:00,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589819820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:00,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:00,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:27:00,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722858347] [2024-10-14 13:27:00,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:00,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:27:00,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:00,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:27:00,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:27:00,841 INFO L87 Difference]: Start difference. First operand 288 states and 324 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-14 13:27:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:00,899 INFO L93 Difference]: Finished difference Result 521 states and 584 transitions. [2024-10-14 13:27:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:27:00,899 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-14 13:27:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:00,900 INFO L225 Difference]: With dead ends: 521 [2024-10-14 13:27:00,900 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 13:27:00,900 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-14 13:27:00,901 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:00,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:27:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 13:27:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 13:27:00,902 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-14 13:27:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 13:27:00,902 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-10-14 13:27:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:00,902 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 13:27:00,902 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-14 13:27:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 13:27:00,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 13:27:00,904 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:27:00,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 13:27:00,907 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-14 13:27:00,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 13:27:27,926 WARN L286 SmtUtils]: Spent 24.98s on a formula simplification. DAG size of input: 202 DAG size of output: 194 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-14 13:27:32,336 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:27:32,350 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,354 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,354 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,356 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,356 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,359 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,359 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,359 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,359 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,359 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,359 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,360 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,362 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,362 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,362 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,362 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,362 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:27:32,362 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:27:32,365 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-14 13:27:32,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-14 13:27:32,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-14 13:27:32,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-14 13:27:32,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-14 13:27:32,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-14 13:27:32,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-14 13:27:32,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-14 13:27:32,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,392 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,392 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,392 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,392 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,392 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,392 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-14 13:27:32,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-14 13:27:32,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-14 13:27:32,394 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-14 13:27:32,394 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,394 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,394 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,394 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,394 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,394 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,394 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,394 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,395 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,395 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,395 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:27:32,395 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:27:32,395 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,395 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,395 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,395 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,395 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,396 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,396 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,396 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,396 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,396 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,396 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,396 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,396 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,396 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:27:32,397 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:27:32,397 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,397 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,397 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,397 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,397 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,397 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,397 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,397 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,397 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,398 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,398 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,398 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,398 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-14 13:27:32,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-14 13:27:32,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-14 13:27:32,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-14 13:27:32,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:27:32,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:27:32,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,401 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,401 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,401 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,401 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,401 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,401 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,401 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,401 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,401 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,402 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:27:32,402 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:27:32,402 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,402 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,402 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,402 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,402 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,402 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,402 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-14 13:27:32,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-14 13:27:32,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-14 13:27:32,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-14 13:27:32,404 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-10-14 13:27:32,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:27:32 BoogieIcfgContainer [2024-10-14 13:27:32,405 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:27:32,406 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:27:32,406 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:27:32,406 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:27:32,406 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:26:46" (3/4) ... [2024-10-14 13:27:32,408 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 13:27:32,411 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 13:27:32,415 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-14 13:27:32,416 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 13:27:32,416 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 13:27:32,416 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 13:27:32,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 13:27:32,495 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 13:27:32,495 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:27:32,495 INFO L158 Benchmark]: Toolchain (without parser) took 46534.72ms. Allocated memory was 153.1MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 80.5MB in the beginning and 794.1MB in the end (delta: -713.6MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-10-14 13:27:32,495 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 153.1MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:27:32,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.76ms. Allocated memory was 153.1MB in the beginning and 251.7MB in the end (delta: 98.6MB). Free memory was 80.3MB in the beginning and 215.7MB in the end (delta: -135.4MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-10-14 13:27:32,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.80ms. Allocated memory is still 251.7MB. Free memory was 215.7MB in the beginning and 212.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:27:32,496 INFO L158 Benchmark]: Boogie Preprocessor took 43.83ms. Allocated memory is still 251.7MB. Free memory was 212.6MB in the beginning and 209.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 13:27:32,496 INFO L158 Benchmark]: RCFGBuilder took 566.84ms. Allocated memory is still 251.7MB. Free memory was 209.4MB in the beginning and 180.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 13:27:32,496 INFO L158 Benchmark]: TraceAbstraction took 45528.01ms. Allocated memory was 251.7MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 180.1MB in the beginning and 802.5MB in the end (delta: -622.4MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-14 13:27:32,496 INFO L158 Benchmark]: Witness Printer took 88.94ms. Allocated memory is still 1.9GB. Free memory was 802.5MB in the beginning and 794.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 13:27:32,497 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.13ms. Allocated memory is still 153.1MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.76ms. Allocated memory was 153.1MB in the beginning and 251.7MB in the end (delta: 98.6MB). Free memory was 80.3MB in the beginning and 215.7MB in the end (delta: -135.4MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.80ms. Allocated memory is still 251.7MB. Free memory was 215.7MB in the beginning and 212.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.83ms. Allocated memory is still 251.7MB. Free memory was 212.6MB in the beginning and 209.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 566.84ms. Allocated memory is still 251.7MB. Free memory was 209.4MB in the beginning and 180.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 45528.01ms. Allocated memory was 251.7MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 180.1MB in the beginning and 802.5MB in the end (delta: -622.4MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 88.94ms. Allocated memory is still 1.9GB. Free memory was 802.5MB in the beginning and 794.1MB 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#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~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[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~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[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~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[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~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[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~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[~#unsigned_char_Array_0~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[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~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[~#unsigned_char_Array_0~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[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~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[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~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[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~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[~#unsigned_char_Array_0~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[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~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[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~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[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] * 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: 14.0s, OverallIterations: 29, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4138 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4117 mSDsluCounter, 12481 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9894 mSDsCounter, 395 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4972 IncrementalHoareTripleChecker+Invalid, 5367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 395 mSolverCounterUnsat, 2587 mSDtfsCounter, 4972 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1190 GetRequests, 912 SyntacticMatches, 4 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=362occurred in iteration=26, InterpolantAutomatonStates: 240, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 1567 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2419 NumberOfCodeBlocks, 2419 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2533 ConstructedInterpolants, 0 QuantifiedInterpolants, 12146 SizeOfPredicates, 31 NumberOfNonLiveVariables, 844 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 34 InterpolantComputations, 27 PerfectInterpolantSequences, 3742/3808 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: 100]: 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) RESULT: Ultimate proved your program to be correct! [2024-10-14 13:27:32,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE