./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 13:19:08,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:19:08,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:19:08,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:19:08,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:19:08,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:19:08,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:19:08,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:19:08,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:19:08,748 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:19:08,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:19:08,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:19:08,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:19:08,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:19:08,756 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:19:08,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:19:08,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:19:08,757 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:19:08,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:19:08,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:19:08,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:19:08,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:19:08,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:19:08,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:19:08,759 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:19:08,759 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:19:08,760 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:19:08,760 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:19:08,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:19:08,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:19:08,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:19:08,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:19:08,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:19:08,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:19:08,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:19:08,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:19:08,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:19:08,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:19:08,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:19:08,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:19:08,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:19:08,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:19:08,768 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-clean/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-clean/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-11 13:19:09,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:19:09,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:19:09,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:19:09,058 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:19:09,059 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:19:09,060 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-11 13:19:10,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:19:10,724 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:19:10,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i [2024-10-11 13:19:10,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/166d280dc/b453467faf7340848c1aa24ee4cf1e81/FLAG12ff40cb2 [2024-10-11 13:19:11,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/166d280dc/b453467faf7340848c1aa24ee4cf1e81 [2024-10-11 13:19:11,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:19:11,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:19:11,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:19:11,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:19:11,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:19:11,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d157e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11, skipping insertion in model container [2024-10-11 13:19:11,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:19:11,331 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-11 13:19:11,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:19:11,412 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:19:11,425 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-11 13:19:11,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:19:11,492 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:19:11,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11 WrapperNode [2024-10-11 13:19:11,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:19:11,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:19:11,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:19:11,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:19:11,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,543 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 330 [2024-10-11 13:19:11,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:19:11,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:19:11,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:19:11,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:19:11,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,588 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-11 13:19:11,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:19:11,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:19:11,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:19:11,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:19:11,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (1/1) ... [2024-10-11 13:19:11,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:19:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:19:11,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:19:11,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:19:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:19:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:19:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:19:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:19:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:19:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:19:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:19:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:19:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:19:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:19:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:19:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:19:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:19:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:19:11,722 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:19:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:19:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:19:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:19:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:19:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:19:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:19:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:19:11,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:19:11,845 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:19:11,847 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:19:12,244 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-10-11 13:19:12,245 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:19:12,292 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:19:12,293 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:19:12,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:19:12 BoogieIcfgContainer [2024-10-11 13:19:12,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:19:12,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:19:12,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:19:12,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:19:12,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:19:11" (1/3) ... [2024-10-11 13:19:12,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29de55ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:19:12, skipping insertion in model container [2024-10-11 13:19:12,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:11" (2/3) ... [2024-10-11 13:19:12,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29de55ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:19:12, skipping insertion in model container [2024-10-11 13:19:12,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:19:12" (3/3) ... [2024-10-11 13:19:12,302 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-62.i [2024-10-11 13:19:12,318 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:19:12,319 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:19:12,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:19:12,381 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;@fb2e77a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:19:12,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:19:12,385 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-11 13:19:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:19:12,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:12,395 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-11 13:19:12,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:12,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:12,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1944691701, now seen corresponding path program 1 times [2024-10-11 13:19:12,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:12,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261202635] [2024-10-11 13:19:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:12,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:12,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:12,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:12,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:12,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:12,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:12,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:12,753 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-11 13:19:12,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:12,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261202635] [2024-10-11 13:19:12,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261202635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:12,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:12,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:19:12,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205929468] [2024-10-11 13:19:12,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:12,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:19:12,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:12,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:19:12,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:19:12,795 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-11 13:19:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:12,838 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2024-10-11 13:19:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:19:12,844 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-11 13:19:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:12,851 INFO L225 Difference]: With dead ends: 129 [2024-10-11 13:19:12,851 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 13:19:12,855 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-11 13:19:12,859 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-11 13:19:12,861 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-11 13:19:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 13:19:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 13:19:12,900 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-11 13:19:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2024-10-11 13:19:12,903 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2024-10-11 13:19:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:12,904 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2024-10-11 13:19:12,904 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-11 13:19:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2024-10-11 13:19:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:19:12,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:12,907 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-11 13:19:12,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:19:12,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:12,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2005151749, now seen corresponding path program 1 times [2024-10-11 13:19:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184213062] [2024-10-11 13:19:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:12,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,233 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-11 13:19:13,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:13,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184213062] [2024-10-11 13:19:13,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184213062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:13,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:13,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:19:13,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820418542] [2024-10-11 13:19:13,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:13,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:19:13,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:13,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:19:13,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:19:13,243 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-11 13:19:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:13,346 INFO L93 Difference]: Finished difference Result 130 states and 187 transitions. [2024-10-11 13:19:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:19:13,349 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-11 13:19:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:13,351 INFO L225 Difference]: With dead ends: 130 [2024-10-11 13:19:13,353 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 13:19:13,354 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-11 13:19:13,355 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-11 13:19:13,358 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-11 13:19:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 13:19:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-11 13:19:13,369 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-11 13:19:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2024-10-11 13:19:13,370 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 68 [2024-10-11 13:19:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:13,372 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2024-10-11 13:19:13,372 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-11 13:19:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2024-10-11 13:19:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:19:13,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:13,375 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-11 13:19:13,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:19:13,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:13,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1947893447, now seen corresponding path program 1 times [2024-10-11 13:19:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:13,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286030141] [2024-10-11 13:19:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,551 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-11 13:19:13,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:13,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286030141] [2024-10-11 13:19:13,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286030141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:13,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:13,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:19:13,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252030501] [2024-10-11 13:19:13,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:13,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:19:13,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:13,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:19:13,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:19:13,557 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-11 13:19:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:13,603 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2024-10-11 13:19:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:19:13,603 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-11 13:19:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:13,606 INFO L225 Difference]: With dead ends: 134 [2024-10-11 13:19:13,606 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 13:19:13,607 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-11 13:19:13,610 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-11 13:19:13,611 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-11 13:19:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 13:19:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-11 13:19:13,621 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-11 13:19:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-11 13:19:13,623 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 68 [2024-10-11 13:19:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:13,624 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-11 13:19:13,625 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-11 13:19:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-11 13:19:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:19:13,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:13,628 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-11 13:19:13,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:19:13,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:13,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:13,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1947833865, now seen corresponding path program 1 times [2024-10-11 13:19:13,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:13,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309111741] [2024-10-11 13:19:13,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:13,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:13,998 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-11 13:19:13,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:13,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309111741] [2024-10-11 13:19:13,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309111741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:14,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:14,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:19:14,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55614683] [2024-10-11 13:19:14,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:14,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:19:14,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:14,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:19:14,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:19:14,003 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-11 13:19:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:14,113 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2024-10-11 13:19:14,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:19:14,113 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-11 13:19:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:14,115 INFO L225 Difference]: With dead ends: 160 [2024-10-11 13:19:14,115 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:19:14,116 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-11 13:19:14,119 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 84 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11 13:19:14,122 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-11 13:19:14,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:19:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2024-10-11 13:19:14,135 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-11 13:19:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2024-10-11 13:19:14,137 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 68 [2024-10-11 13:19:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:14,137 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2024-10-11 13:19:14,137 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-11 13:19:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2024-10-11 13:19:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:19:14,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:14,139 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-11 13:19:14,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:19:14,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:14,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1661631908, now seen corresponding path program 1 times [2024-10-11 13:19:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:14,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292004091] [2024-10-11 13:19:14,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:14,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,377 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-11 13:19:14,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:14,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292004091] [2024-10-11 13:19:14,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292004091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:14,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:14,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829097319] [2024-10-11 13:19:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:14,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:14,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:14,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:14,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:14,380 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-11 13:19:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:14,537 INFO L93 Difference]: Finished difference Result 205 states and 287 transitions. [2024-10-11 13:19:14,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:14,538 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-11 13:19:14,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:14,540 INFO L225 Difference]: With dead ends: 205 [2024-10-11 13:19:14,541 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 13:19:14,542 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-11 13:19:14,542 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-11 13:19:14,543 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-11 13:19:14,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 13:19:14,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 78. [2024-10-11 13:19:14,554 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-11 13:19:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-10-11 13:19:14,556 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 70 [2024-10-11 13:19:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:14,558 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-10-11 13:19:14,558 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-11 13:19:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2024-10-11 13:19:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 13:19:14,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:14,559 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-11 13:19:14,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:19:14,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:14,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:14,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1362359734, now seen corresponding path program 1 times [2024-10-11 13:19:14,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:14,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711567453] [2024-10-11 13:19:14,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:14,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,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-11 13:19:14,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:14,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711567453] [2024-10-11 13:19:14,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711567453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:14,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:14,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:14,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709173273] [2024-10-11 13:19:14,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:14,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:14,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:14,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:14,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:14,937 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-11 13:19:15,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:15,031 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2024-10-11 13:19:15,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:15,032 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-11 13:19:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:15,033 INFO L225 Difference]: With dead ends: 188 [2024-10-11 13:19:15,035 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 13:19:15,036 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-11 13:19:15,037 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:15,037 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.1s Time] [2024-10-11 13:19:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 13:19:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2024-10-11 13:19:15,048 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-11 13:19:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-10-11 13:19:15,049 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 72 [2024-10-11 13:19:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:15,050 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-10-11 13:19:15,050 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-11 13:19:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-10-11 13:19:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 13:19:15,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:15,055 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-11 13:19:15,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:19:15,056 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:15,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash -686157583, now seen corresponding path program 1 times [2024-10-11 13:19:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:15,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904499985] [2024-10-11 13:19:15,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,206 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-11 13:19:15,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:15,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904499985] [2024-10-11 13:19:15,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904499985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:15,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:15,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:15,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248003278] [2024-10-11 13:19:15,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:15,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:15,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:15,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:15,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:19:15,209 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-11 13:19:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:15,249 INFO L93 Difference]: Finished difference Result 158 states and 219 transitions. [2024-10-11 13:19:15,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:15,250 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-11 13:19:15,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:15,251 INFO L225 Difference]: With dead ends: 158 [2024-10-11 13:19:15,251 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 13:19:15,252 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-11 13:19:15,252 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-11 13:19:15,253 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-11 13:19:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 13:19:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 13:19:15,263 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-11 13:19:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2024-10-11 13:19:15,264 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 72 [2024-10-11 13:19:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:15,264 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2024-10-11 13:19:15,264 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-11 13:19:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2024-10-11 13:19:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 13:19:15,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:15,265 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-11 13:19:15,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:19:15,266 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:15,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1885600574, now seen corresponding path program 1 times [2024-10-11 13:19:15,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:15,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404458487] [2024-10-11 13:19:15,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:15,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,534 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-11 13:19:15,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:15,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404458487] [2024-10-11 13:19:15,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404458487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:15,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:15,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393299769] [2024-10-11 13:19:15,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:15,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:15,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:15,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:15,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:15,538 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-11 13:19:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:15,619 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2024-10-11 13:19:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:15,620 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-11 13:19:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:15,621 INFO L225 Difference]: With dead ends: 192 [2024-10-11 13:19:15,621 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 13:19:15,621 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-11 13:19:15,622 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:15,622 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.1s Time] [2024-10-11 13:19:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 13:19:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2024-10-11 13:19:15,633 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-11 13:19:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2024-10-11 13:19:15,635 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 72 [2024-10-11 13:19:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:15,635 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2024-10-11 13:19:15,635 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-11 13:19:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2024-10-11 13:19:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 13:19:15,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:15,636 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-11 13:19:15,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:19:15,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:15,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash 772475292, now seen corresponding path program 1 times [2024-10-11 13:19:15,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:15,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8362769] [2024-10-11 13:19:15,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:15,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:16,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:16,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:16,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:16,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:16,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:16,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:16,155 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-11 13:19:16,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:16,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8362769] [2024-10-11 13:19:16,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8362769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:16,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767251533] [2024-10-11 13:19:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:16,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:19:16,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:19:16,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:19:16,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:19:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:16,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 13:19:16,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:16,449 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-11 13:19:16,483 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-11 13:19:16,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-11 13:19:16,519 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-11 13:19:16,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:16,595 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-11 13:19:16,809 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-11 13:19:16,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767251533] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:19:16,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:19:16,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-10-11 13:19:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216631314] [2024-10-11 13:19:16,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:19:16,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 13:19:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:16,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 13:19:16,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:19:16,811 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-11 13:19:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:17,378 INFO L93 Difference]: Finished difference Result 222 states and 291 transitions. [2024-10-11 13:19:17,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:19:17,379 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-11 13:19:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:17,380 INFO L225 Difference]: With dead ends: 222 [2024-10-11 13:19:17,381 INFO L226 Difference]: Without dead ends: 142 [2024-10-11 13:19:17,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2024-10-11 13:19:17,382 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:17,382 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.4s Time] [2024-10-11 13:19:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-11 13:19:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2024-10-11 13:19:17,389 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-11 13:19:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2024-10-11 13:19:17,390 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 74 [2024-10-11 13:19:17,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:17,390 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2024-10-11 13:19:17,391 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-11 13:19:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2024-10-11 13:19:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 13:19:17,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:17,392 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-11 13:19:17,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:19:17,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:19:17,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:17,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:17,593 INFO L85 PathProgramCache]: Analyzing trace with hash -238641958, now seen corresponding path program 1 times [2024-10-11 13:19:17,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:17,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328026439] [2024-10-11 13:19:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:17,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:17,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:17,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:17,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:17,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:17,899 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-11 13:19:17,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:17,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328026439] [2024-10-11 13:19:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328026439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:17,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:17,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:19:17,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233466722] [2024-10-11 13:19:17,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:17,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:19:17,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:17,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:19:17,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:19:17,901 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-11 13:19:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:18,031 INFO L93 Difference]: Finished difference Result 325 states and 420 transitions. [2024-10-11 13:19:18,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:19:18,032 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-11 13:19:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:18,034 INFO L225 Difference]: With dead ends: 325 [2024-10-11 13:19:18,035 INFO L226 Difference]: Without dead ends: 187 [2024-10-11 13:19:18,035 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-11 13:19:18,036 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-11 13:19:18,036 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-11 13:19:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-11 13:19:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 144. [2024-10-11 13:19:18,047 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-11 13:19:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2024-10-11 13:19:18,048 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 74 [2024-10-11 13:19:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:18,048 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2024-10-11 13:19:18,048 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-11 13:19:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2024-10-11 13:19:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 13:19:18,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:18,053 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:18,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:19:18,053 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:18,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash 184059868, now seen corresponding path program 1 times [2024-10-11 13:19:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:18,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382478932] [2024-10-11 13:19:18,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:18,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:18,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:18,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:18,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:18,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:18,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:18,736 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-11 13:19:18,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:18,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382478932] [2024-10-11 13:19:18,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382478932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:18,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941383503] [2024-10-11 13:19:18,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:18,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:19:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:19:18,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:19:18,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:19:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:18,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 13:19:18,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:18,878 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-11 13:19:19,103 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-11 13:19:19,117 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-11 13:19:19,141 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-11 13:19:19,157 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-11 13:19:19,162 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-11 13:19:19,182 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-11 13:19:19,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:19,370 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-11 13:19:19,410 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-11 13:19:19,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941383503] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:19:19,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:19:19,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2024-10-11 13:19:19,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048728867] [2024-10-11 13:19:19,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:19:19,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 13:19:19,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:19,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 13:19:19,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:19:19,413 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-11 13:19:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:20,630 INFO L93 Difference]: Finished difference Result 719 states and 925 transitions. [2024-10-11 13:19:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 13:19:20,630 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-11 13:19:20,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:20,633 INFO L225 Difference]: With dead ends: 719 [2024-10-11 13:19:20,633 INFO L226 Difference]: Without dead ends: 576 [2024-10-11 13:19:20,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 13:19:20,635 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1965 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:20,635 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.7s Time] [2024-10-11 13:19:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-11 13:19:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 297. [2024-10-11 13:19:20,650 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-11 13:19:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 386 transitions. [2024-10-11 13:19:20,652 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 386 transitions. Word has length 74 [2024-10-11 13:19:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:20,652 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 386 transitions. [2024-10-11 13:19:20,653 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-11 13:19:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-10-11 13:19:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:19:20,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:20,654 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-11 13:19:20,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:19:20,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:19:20,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:20,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:20,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1615265287, now seen corresponding path program 1 times [2024-10-11 13:19:20,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:20,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836302685] [2024-10-11 13:19:20,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:20,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:21,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:21,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:21,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:21,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:21,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:21,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:21,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:21,759 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-11 13:19:21,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:21,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836302685] [2024-10-11 13:19:21,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836302685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:21,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:21,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:19:21,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226190064] [2024-10-11 13:19:21,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:21,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:19:21,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:21,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:19:21,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:19:21,762 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-11 13:19:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:22,197 INFO L93 Difference]: Finished difference Result 677 states and 878 transitions. [2024-10-11 13:19:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:19:22,198 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-11 13:19:22,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:22,200 INFO L225 Difference]: With dead ends: 677 [2024-10-11 13:19:22,200 INFO L226 Difference]: Without dead ends: 381 [2024-10-11 13:19:22,201 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-11 13:19:22,202 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 122 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:22,202 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.3s Time] [2024-10-11 13:19:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-11 13:19:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 299. [2024-10-11 13:19:22,219 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-11 13:19:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 388 transitions. [2024-10-11 13:19:22,221 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 388 transitions. Word has length 75 [2024-10-11 13:19:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:22,221 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 388 transitions. [2024-10-11 13:19:22,221 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-11 13:19:22,221 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 388 transitions. [2024-10-11 13:19:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:19:22,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:22,223 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-11 13:19:22,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:19:22,223 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:22,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1396410569, now seen corresponding path program 1 times [2024-10-11 13:19:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:22,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470363910] [2024-10-11 13:19:22,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:22,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:22,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:22,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:22,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:22,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:22,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:22,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:22,490 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-11 13:19:22,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:22,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470363910] [2024-10-11 13:19:22,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470363910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:22,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:22,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:19:22,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025083083] [2024-10-11 13:19:22,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:22,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:19:22,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:22,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:19:22,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:19:22,492 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-11 13:19:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:22,643 INFO L93 Difference]: Finished difference Result 745 states and 966 transitions. [2024-10-11 13:19:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:19:22,644 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-11 13:19:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:22,647 INFO L225 Difference]: With dead ends: 745 [2024-10-11 13:19:22,647 INFO L226 Difference]: Without dead ends: 447 [2024-10-11 13:19:22,648 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-11 13:19:22,648 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-11 13:19:22,649 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-11 13:19:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-11 13:19:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 277. [2024-10-11 13:19:22,664 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-11 13:19:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 357 transitions. [2024-10-11 13:19:22,666 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 357 transitions. Word has length 75 [2024-10-11 13:19:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:22,666 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 357 transitions. [2024-10-11 13:19:22,666 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-11 13:19:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 357 transitions. [2024-10-11 13:19:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:19:22,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:22,667 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-11 13:19:22,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:19:22,668 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:22,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:22,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1887439477, now seen corresponding path program 1 times [2024-10-11 13:19:22,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:22,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767559734] [2024-10-11 13:19:22,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:22,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:23,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:23,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:23,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:23,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:23,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:23,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:23,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:23,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:23,708 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-11 13:19:23,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:23,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767559734] [2024-10-11 13:19:23,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767559734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:23,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:23,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 13:19:23,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647545416] [2024-10-11 13:19:23,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:23,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 13:19:23,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:23,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 13:19:23,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:19:23,711 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-11 13:19:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:24,720 INFO L93 Difference]: Finished difference Result 836 states and 1062 transitions. [2024-10-11 13:19:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 13:19:24,722 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-11 13:19:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:24,726 INFO L225 Difference]: With dead ends: 836 [2024-10-11 13:19:24,726 INFO L226 Difference]: Without dead ends: 560 [2024-10-11 13:19:24,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=1148, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 13:19:24,732 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 735 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:24,732 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.6s Time] [2024-10-11 13:19:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-11 13:19:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 291. [2024-10-11 13:19:24,752 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-11 13:19:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 374 transitions. [2024-10-11 13:19:24,754 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 374 transitions. Word has length 75 [2024-10-11 13:19:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:24,755 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 374 transitions. [2024-10-11 13:19:24,755 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-11 13:19:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 374 transitions. [2024-10-11 13:19:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:19:24,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:24,756 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-11 13:19:24,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:19:24,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:24,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash -292261228, now seen corresponding path program 1 times [2024-10-11 13:19:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:24,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404073460] [2024-10-11 13:19:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:24,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:24,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:24,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:24,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:24,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:24,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:24,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:24,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:24,877 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-11 13:19:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:24,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404073460] [2024-10-11 13:19:24,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404073460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:24,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:24,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:24,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134666182] [2024-10-11 13:19:24,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:24,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:24,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:24,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:24,880 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-11 13:19:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:24,925 INFO L93 Difference]: Finished difference Result 597 states and 767 transitions. [2024-10-11 13:19:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:24,926 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-11 13:19:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:24,928 INFO L225 Difference]: With dead ends: 597 [2024-10-11 13:19:24,928 INFO L226 Difference]: Without dead ends: 307 [2024-10-11 13:19:24,929 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-11 13:19:24,930 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-11 13:19:24,930 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-11 13:19:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-11 13:19:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 295. [2024-10-11 13:19:24,945 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-11 13:19:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 378 transitions. [2024-10-11 13:19:24,946 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 378 transitions. Word has length 75 [2024-10-11 13:19:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:24,946 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 378 transitions. [2024-10-11 13:19:24,946 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-11 13:19:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 378 transitions. [2024-10-11 13:19:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:19:24,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:24,947 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-11 13:19:24,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:19:24,948 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:24,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1154154267, now seen corresponding path program 1 times [2024-10-11 13:19:24,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:24,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286279177] [2024-10-11 13:19:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:25,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:25,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:25,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:25,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:25,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:25,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:25,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:25,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:25,081 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-11 13:19:25,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:25,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286279177] [2024-10-11 13:19:25,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286279177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:25,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:25,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:25,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869248715] [2024-10-11 13:19:25,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:25,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:25,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:25,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:25,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:19:25,084 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-11 13:19:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:25,176 INFO L93 Difference]: Finished difference Result 597 states and 761 transitions. [2024-10-11 13:19:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:25,178 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-11 13:19:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:25,180 INFO L225 Difference]: With dead ends: 597 [2024-10-11 13:19:25,180 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 13:19:25,181 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-11 13:19:25,182 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-11 13:19:25,182 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-11 13:19:25,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 13:19:25,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 213. [2024-10-11 13:19:25,195 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-11 13:19:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 268 transitions. [2024-10-11 13:19:25,196 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 268 transitions. Word has length 75 [2024-10-11 13:19:25,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:25,197 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 268 transitions. [2024-10-11 13:19:25,197 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-11 13:19:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 268 transitions. [2024-10-11 13:19:25,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 13:19:25,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:25,198 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-11 13:19:25,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 13:19:25,198 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:25,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:25,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1636270173, now seen corresponding path program 1 times [2024-10-11 13:19:25,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:25,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408161744] [2024-10-11 13:19:25,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:25,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:26,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:26,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:26,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:26,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:26,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:26,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:26,293 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-11 13:19:26,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:26,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408161744] [2024-10-11 13:19:26,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408161744] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905941389] [2024-10-11 13:19:26,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:26,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:19:26,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:19:26,296 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:19:26,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 13:19:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:26,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:19:26,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:26,448 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-11 13:19:26,478 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-11 13:19:26,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:26,668 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-11 13:19:26,825 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-11 13:19:26,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:19:26,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905941389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:26,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:19:26,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 26 [2024-10-11 13:19:26,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097670933] [2024-10-11 13:19:26,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:26,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:19:26,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:26,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:19:26,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2024-10-11 13:19:26,828 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-11 13:19:27,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:27,103 INFO L93 Difference]: Finished difference Result 511 states and 640 transitions. [2024-10-11 13:19:27,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:19:27,104 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-11 13:19:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:27,106 INFO L225 Difference]: With dead ends: 511 [2024-10-11 13:19:27,107 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 13:19:27,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:19:27,109 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-11 13:19:27,109 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-11 13:19:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 13:19:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 96. [2024-10-11 13:19:27,124 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-11 13:19:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2024-10-11 13:19:27,126 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 76 [2024-10-11 13:19:27,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:27,127 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2024-10-11 13:19:27,127 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-11 13:19:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2024-10-11 13:19:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 13:19:27,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:27,129 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-11 13:19:27,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 13:19:27,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:19:27,330 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:27,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:27,330 INFO L85 PathProgramCache]: Analyzing trace with hash 63343981, now seen corresponding path program 1 times [2024-10-11 13:19:27,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:27,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900457960] [2024-10-11 13:19:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:27,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,570 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-11 13:19:27,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:27,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900457960] [2024-10-11 13:19:27,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900457960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:27,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:27,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077734633] [2024-10-11 13:19:27,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:27,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:27,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:27,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:27,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:27,573 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-11 13:19:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:27,645 INFO L93 Difference]: Finished difference Result 226 states and 282 transitions. [2024-10-11 13:19:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:27,645 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-11 13:19:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:27,646 INFO L225 Difference]: With dead ends: 226 [2024-10-11 13:19:27,646 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 13:19:27,647 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-11 13:19:27,648 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:27,648 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.1s Time] [2024-10-11 13:19:27,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 13:19:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2024-10-11 13:19:27,656 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-11 13:19:27,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2024-10-11 13:19:27,657 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 77 [2024-10-11 13:19:27,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:27,657 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2024-10-11 13:19:27,657 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-11 13:19:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2024-10-11 13:19:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 13:19:27,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:27,658 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-11 13:19:27,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 13:19:27,658 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:27,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1702671271, now seen corresponding path program 1 times [2024-10-11 13:19:27,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:27,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20079993] [2024-10-11 13:19:27,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:27,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:27,887 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-11 13:19:27,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:27,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20079993] [2024-10-11 13:19:27,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20079993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:27,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:27,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:27,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712424887] [2024-10-11 13:19:27,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:27,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:27,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:27,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:27,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:27,891 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-11 13:19:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:27,961 INFO L93 Difference]: Finished difference Result 222 states and 276 transitions. [2024-10-11 13:19:27,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:27,962 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-11 13:19:27,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:27,963 INFO L225 Difference]: With dead ends: 222 [2024-10-11 13:19:27,963 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 13:19:27,964 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-11 13:19:27,964 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:27,964 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.1s Time] [2024-10-11 13:19:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 13:19:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 101. [2024-10-11 13:19:27,976 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-11 13:19:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2024-10-11 13:19:27,977 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 78 [2024-10-11 13:19:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:27,978 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2024-10-11 13:19:27,978 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-11 13:19:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2024-10-11 13:19:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 13:19:27,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:27,979 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-11 13:19:27,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 13:19:27,979 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:27,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2094073389, now seen corresponding path program 1 times [2024-10-11 13:19:27,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:27,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176925677] [2024-10-11 13:19:27,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,281 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-11 13:19:28,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:28,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176925677] [2024-10-11 13:19:28,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176925677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:28,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:28,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:19:28,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154468032] [2024-10-11 13:19:28,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:28,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:19:28,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:28,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:19:28,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:19:28,283 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-11 13:19:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:28,410 INFO L93 Difference]: Finished difference Result 280 states and 338 transitions. [2024-10-11 13:19:28,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:19:28,410 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-11 13:19:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:28,411 INFO L225 Difference]: With dead ends: 280 [2024-10-11 13:19:28,412 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 13:19:28,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:19:28,412 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 53 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11 13:19:28,413 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-11 13:19:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 13:19:28,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 169. [2024-10-11 13:19:28,426 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-11 13:19:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 203 transitions. [2024-10-11 13:19:28,427 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 203 transitions. Word has length 78 [2024-10-11 13:19:28,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:28,427 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 203 transitions. [2024-10-11 13:19:28,428 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-11 13:19:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 203 transitions. [2024-10-11 13:19:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 13:19:28,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:28,429 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-11 13:19:28,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 13:19:28,429 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:28,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:28,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1875218671, now seen corresponding path program 1 times [2024-10-11 13:19:28,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:28,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426980195] [2024-10-11 13:19:28,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:28,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:28,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-11 13:19:28,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:28,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426980195] [2024-10-11 13:19:28,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426980195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:28,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:28,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:28,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469182106] [2024-10-11 13:19:28,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:28,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:28,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:28,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:28,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:19:28,515 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-11 13:19:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:28,626 INFO L93 Difference]: Finished difference Result 383 states and 459 transitions. [2024-10-11 13:19:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:28,627 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-11 13:19:28,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:28,630 INFO L225 Difference]: With dead ends: 383 [2024-10-11 13:19:28,630 INFO L226 Difference]: Without dead ends: 215 [2024-10-11 13:19:28,631 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-11 13:19:28,631 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-11 13:19:28,631 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-11 13:19:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-11 13:19:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 184. [2024-10-11 13:19:28,648 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-11 13:19:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 219 transitions. [2024-10-11 13:19:28,649 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 219 transitions. Word has length 78 [2024-10-11 13:19:28,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:28,649 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 219 transitions. [2024-10-11 13:19:28,649 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-11 13:19:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 219 transitions. [2024-10-11 13:19:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 13:19:28,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:28,650 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-11 13:19:28,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 13:19:28,651 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:28,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:28,651 INFO L85 PathProgramCache]: Analyzing trace with hash -606322452, now seen corresponding path program 1 times [2024-10-11 13:19:28,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:28,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423518620] [2024-10-11 13:19:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:28,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,471 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-11 13:19:29,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:29,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423518620] [2024-10-11 13:19:29,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423518620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:29,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:29,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:29,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290852507] [2024-10-11 13:19:29,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:29,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:29,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:29,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:29,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:19:29,473 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-11 13:19:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:29,628 INFO L93 Difference]: Finished difference Result 226 states and 269 transitions. [2024-10-11 13:19:29,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:29,629 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-11 13:19:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:29,631 INFO L225 Difference]: With dead ends: 226 [2024-10-11 13:19:29,631 INFO L226 Difference]: Without dead ends: 224 [2024-10-11 13:19:29,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:19:29,632 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 59 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11 13:19:29,632 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-11 13:19:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-11 13:19:29,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2024-10-11 13:19:29,659 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-11 13:19:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 259 transitions. [2024-10-11 13:19:29,660 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 259 transitions. Word has length 80 [2024-10-11 13:19:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:29,661 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 259 transitions. [2024-10-11 13:19:29,661 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-11 13:19:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 259 transitions. [2024-10-11 13:19:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 13:19:29,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:29,662 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-11 13:19:29,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 13:19:29,662 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:29,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash -606262870, now seen corresponding path program 1 times [2024-10-11 13:19:29,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:29,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499174004] [2024-10-11 13:19:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:29,802 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-11 13:19:29,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:29,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499174004] [2024-10-11 13:19:29,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499174004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:29,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:29,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55156024] [2024-10-11 13:19:29,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:29,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:29,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:29,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:19:29,804 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-11 13:19:29,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:29,886 INFO L93 Difference]: Finished difference Result 415 states and 487 transitions. [2024-10-11 13:19:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:29,887 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-11 13:19:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:29,888 INFO L225 Difference]: With dead ends: 415 [2024-10-11 13:19:29,889 INFO L226 Difference]: Without dead ends: 228 [2024-10-11 13:19:29,889 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-11 13:19:29,890 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-11 13:19:29,890 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-11 13:19:29,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-11 13:19:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-10-11 13:19:29,918 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-11 13:19:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 263 transitions. [2024-10-11 13:19:29,919 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 263 transitions. Word has length 80 [2024-10-11 13:19:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:29,920 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 263 transitions. [2024-10-11 13:19:29,920 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-11 13:19:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 263 transitions. [2024-10-11 13:19:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 13:19:29,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:29,921 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-11 13:19:29,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 13:19:29,921 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:29,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:29,922 INFO L85 PathProgramCache]: Analyzing trace with hash -549004568, now seen corresponding path program 1 times [2024-10-11 13:19:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640628592] [2024-10-11 13:19:29,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:29,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:30,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:30,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:30,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:30,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:30,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:30,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:30,553 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-11 13:19:30,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:30,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640628592] [2024-10-11 13:19:30,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640628592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:30,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:30,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:19:30,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258784982] [2024-10-11 13:19:30,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:30,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:19:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:30,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:19:30,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:19:30,557 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-11 13:19:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:30,792 INFO L93 Difference]: Finished difference Result 564 states and 653 transitions. [2024-10-11 13:19:30,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:19:30,793 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-11 13:19:30,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:30,794 INFO L225 Difference]: With dead ends: 564 [2024-10-11 13:19:30,795 INFO L226 Difference]: Without dead ends: 369 [2024-10-11 13:19:30,796 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-11 13:19:30,796 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-11 13:19:30,797 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-11 13:19:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-11 13:19:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 329. [2024-10-11 13:19:30,825 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-11 13:19:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 379 transitions. [2024-10-11 13:19:30,826 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 379 transitions. Word has length 80 [2024-10-11 13:19:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:30,826 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 379 transitions. [2024-10-11 13:19:30,826 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-11 13:19:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 379 transitions. [2024-10-11 13:19:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 13:19:30,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:30,827 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-11 13:19:30,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 13:19:30,828 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:30,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash 847893285, now seen corresponding path program 1 times [2024-10-11 13:19:30,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:30,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063463632] [2024-10-11 13:19:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,035 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-11 13:19:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:31,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063463632] [2024-10-11 13:19:31,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063463632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:31,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:31,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686427745] [2024-10-11 13:19:31,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:31,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:31,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:31,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:31,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:31,037 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-11 13:19:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:31,124 INFO L93 Difference]: Finished difference Result 673 states and 776 transitions. [2024-10-11 13:19:31,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:31,129 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-11 13:19:31,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:31,131 INFO L225 Difference]: With dead ends: 673 [2024-10-11 13:19:31,131 INFO L226 Difference]: Without dead ends: 377 [2024-10-11 13:19:31,132 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-11 13:19:31,132 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-11 13:19:31,132 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-11 13:19:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-10-11 13:19:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 287. [2024-10-11 13:19:31,177 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-11 13:19:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 327 transitions. [2024-10-11 13:19:31,178 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 327 transitions. Word has length 81 [2024-10-11 13:19:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:31,178 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 327 transitions. [2024-10-11 13:19:31,178 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-11 13:19:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 327 transitions. [2024-10-11 13:19:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 13:19:31,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:31,180 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-11 13:19:31,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 13:19:31,180 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:31,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1067300445, now seen corresponding path program 1 times [2024-10-11 13:19:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:31,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245763199] [2024-10-11 13:19:31,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:31,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,432 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-11 13:19:31,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:31,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245763199] [2024-10-11 13:19:31,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245763199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:31,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:31,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:31,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40077098] [2024-10-11 13:19:31,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:31,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:31,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:31,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:31,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:31,434 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-11 13:19:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:31,572 INFO L93 Difference]: Finished difference Result 634 states and 720 transitions. [2024-10-11 13:19:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:31,572 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-11 13:19:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:31,574 INFO L225 Difference]: With dead ends: 634 [2024-10-11 13:19:31,574 INFO L226 Difference]: Without dead ends: 380 [2024-10-11 13:19:31,575 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-11 13:19:31,575 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-11 13:19:31,576 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-11 13:19:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-11 13:19:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 362. [2024-10-11 13:19:31,605 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-11 13:19:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 410 transitions. [2024-10-11 13:19:31,607 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 410 transitions. Word has length 82 [2024-10-11 13:19:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:31,607 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 410 transitions. [2024-10-11 13:19:31,608 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-11 13:19:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 410 transitions. [2024-10-11 13:19:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 13:19:31,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:31,609 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-11 13:19:31,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 13:19:31,609 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:31,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:31,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1832706834, now seen corresponding path program 1 times [2024-10-11 13:19:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:31,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683961162] [2024-10-11 13:19:31,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:31,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,719 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-11 13:19:31,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683961162] [2024-10-11 13:19:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683961162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:31,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:31,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:31,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030167299] [2024-10-11 13:19:31,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:31,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:31,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:31,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:19:31,720 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-11 13:19:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:31,843 INFO L93 Difference]: Finished difference Result 615 states and 696 transitions. [2024-10-11 13:19:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:31,844 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-11 13:19:31,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:31,845 INFO L225 Difference]: With dead ends: 615 [2024-10-11 13:19:31,845 INFO L226 Difference]: Without dead ends: 286 [2024-10-11 13:19:31,846 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-11 13:19:31,847 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:31,847 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.1s Time] [2024-10-11 13:19:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-11 13:19:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-10-11 13:19:31,893 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-11 13:19:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 322 transitions. [2024-10-11 13:19:31,894 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 322 transitions. Word has length 82 [2024-10-11 13:19:31,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:31,896 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 322 transitions. [2024-10-11 13:19:31,896 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-11 13:19:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 322 transitions. [2024-10-11 13:19:31,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 13:19:31,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:31,898 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-11 13:19:31,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 13:19:31,898 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:31,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:31,899 INFO L85 PathProgramCache]: Analyzing trace with hash -10337099, now seen corresponding path program 1 times [2024-10-11 13:19:31,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:31,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265378489] [2024-10-11 13:19:31,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:31,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,539 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-11 13:19:32,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:32,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265378489] [2024-10-11 13:19:32,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265378489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:32,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:32,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:19:32,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713851763] [2024-10-11 13:19:32,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:32,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:19:32,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:32,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:19:32,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:19:32,541 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-11 13:19:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:32,723 INFO L93 Difference]: Finished difference Result 547 states and 617 transitions. [2024-10-11 13:19:32,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:19:32,723 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-11 13:19:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:32,725 INFO L225 Difference]: With dead ends: 547 [2024-10-11 13:19:32,725 INFO L226 Difference]: Without dead ends: 294 [2024-10-11 13:19:32,726 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-11 13:19:32,727 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-11 13:19:32,729 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-11 13:19:32,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-11 13:19:32,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 288. [2024-10-11 13:19:32,759 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-11 13:19:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 324 transitions. [2024-10-11 13:19:32,761 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 324 transitions. Word has length 83 [2024-10-11 13:19:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:32,761 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 324 transitions. [2024-10-11 13:19:32,762 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-11 13:19:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 324 transitions. [2024-10-11 13:19:32,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:19:32,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:32,763 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-11 13:19:32,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 13:19:32,763 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:32,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1104038769, now seen corresponding path program 1 times [2024-10-11 13:19:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:32,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876399690] [2024-10-11 13:19:32,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,874 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-11 13:19:32,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876399690] [2024-10-11 13:19:32,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876399690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:32,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:32,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:32,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375140456] [2024-10-11 13:19:32,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:32,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:32,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:32,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:32,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:19:32,876 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-11 13:19:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:32,951 INFO L93 Difference]: Finished difference Result 521 states and 584 transitions. [2024-10-11 13:19:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:32,952 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-11 13:19:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:32,953 INFO L225 Difference]: With dead ends: 521 [2024-10-11 13:19:32,953 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 13:19:32,954 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-11 13:19:32,954 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-11 13:19:32,955 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-11 13:19:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 13:19:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 13:19:32,955 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-11 13:19:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 13:19:32,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-10-11 13:19:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:32,956 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 13:19:32,956 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-11 13:19:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 13:19:32,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 13:19:32,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:19:32,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 13:19:32,964 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-11 13:19:32,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 13:20:01,423 WARN L286 SmtUtils]: Spent 25.95s 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-11 13:20:06,355 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:20:06,365 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,365 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,366 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-11 13:20:06,367 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,367 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,368 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-11 13:20:06,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,368 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-11 13:20:06,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,368 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-11 13:20:06,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,368 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-11 13:20:06,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,369 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-11 13:20:06,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,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-11 13:20:06,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,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-11 13:20:06,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,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-11 13:20:06,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-11 13:20:06,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-11 13:20:06,371 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-11 13:20:06,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,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-11 13:20:06,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,372 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,372 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-11 13:20:06,372 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,372 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,372 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-11 13:20:06,372 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,372 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,373 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-11 13:20:06,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-11 13:20:06,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-11 13:20:06,373 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-11 13:20:06,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,374 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-11 13:20:06,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,374 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-11 13:20:06,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,374 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-11 13:20:06,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,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-11 13:20:06,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,375 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-11 13:20:06,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-11 13:20:06,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-11 13:20:06,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-11 13:20:06,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,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-11 13:20:06,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-11 13:20:06,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-11 13:20:06,376 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-11 13:20:06,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,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-11 13:20:06,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,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-11 13:20:06,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-11 13:20:06,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-11 13:20:06,378 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-11 13:20:06,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-11 13:20:06,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-11 13:20:06,378 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-11 13:20:06,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,379 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-11 13:20:06,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,379 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-11 13:20:06,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,379 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-11 13:20:06,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,379 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-11 13:20:06,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,380 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-11 13:20:06,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,383 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,384 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-11 13:20:06,384 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,384 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,384 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-11 13:20:06,384 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,384 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,385 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-11 13:20:06,398 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,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-11 13:20:06,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,399 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-11 13:20:06,399 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,400 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-11 13:20:06,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,400 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-11 13:20:06,400 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-11 13:20:06,402 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-11 13:20:06,402 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-11 13:20:06,402 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-11 13:20:06,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-11 13:20:06,403 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-11 13:20:06,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,403 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-11 13:20:06,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,403 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-11 13:20:06,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,403 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,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-11 13:20:06,404 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-11 13:20:06,404 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-11 13:20:06,404 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-11 13:20:06,404 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,404 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,404 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-11 13:20:06,404 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,404 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,405 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-11 13:20:06,405 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,405 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,405 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-11 13:20:06,405 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,407 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,407 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-11 13:20:06,407 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-11 13:20:06,408 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-11 13:20:06,408 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-11 13:20:06,408 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,408 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,408 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-11 13:20:06,408 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,408 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,408 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-11 13:20:06,409 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,409 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,409 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-11 13:20:06,409 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,409 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,409 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-11 13:20:06,410 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,410 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,410 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-11 13:20:06,410 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-11 13:20:06,410 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-11 13:20:06,411 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-11 13:20:06,411 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-11 13:20:06,411 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-11 13:20:06,411 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-11 13:20:06,411 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,411 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,411 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-11 13:20:06,411 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-11 13:20:06,411 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-11 13:20:06,411 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-11 13:20:06,411 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,411 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,411 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-11 13:20:06,411 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,412 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,412 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-11 13:20:06,412 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,412 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,412 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-11 13:20:06,412 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,412 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,412 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-11 13:20:06,412 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-11 13:20:06,412 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-11 13:20:06,412 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-11 13:20:06,412 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,412 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,413 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-11 13:20:06,413 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,413 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,413 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-11 13:20:06,413 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,413 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,413 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-11 13:20:06,413 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-11 13:20:06,413 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-11 13:20:06,413 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-11 13:20:06,413 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 13:20:06,413 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 13:20:06,413 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-11 13:20:06,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:20:06 BoogieIcfgContainer [2024-10-11 13:20:06,420 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:20:06,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:20:06,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:20:06,421 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:20:06,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:19:12" (3/4) ... [2024-10-11 13:20:06,423 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 13:20:06,427 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 13:20:06,440 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 13:20:06,441 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 13:20:06,441 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 13:20:06,441 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 13:20:06,583 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 13:20:06,584 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 13:20:06,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:20:06,584 INFO L158 Benchmark]: Toolchain (without parser) took 55475.13ms. Allocated memory was 123.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 69.4MB in the beginning and 957.5MB in the end (delta: -888.0MB). Peak memory consumption was 210.5MB. Max. memory is 16.1GB. [2024-10-11 13:20:06,584 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:20:06,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.49ms. Allocated memory is still 123.7MB. Free memory was 69.2MB in the beginning and 54.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:20:06,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.29ms. Allocated memory is still 123.7MB. Free memory was 54.4MB in the beginning and 51.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:20:06,585 INFO L158 Benchmark]: Boogie Preprocessor took 72.22ms. Allocated memory is still 123.7MB. Free memory was 51.3MB in the beginning and 47.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:20:06,585 INFO L158 Benchmark]: RCFGBuilder took 673.38ms. Allocated memory was 123.7MB in the beginning and 159.4MB in the end (delta: 35.7MB). Free memory was 47.4MB in the beginning and 112.1MB in the end (delta: -64.8MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-10-11 13:20:06,585 INFO L158 Benchmark]: TraceAbstraction took 54123.41ms. Allocated memory was 159.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 112.1MB in the beginning and 966.9MB in the end (delta: -854.8MB). Peak memory consumption was 721.1MB. Max. memory is 16.1GB. [2024-10-11 13:20:06,585 INFO L158 Benchmark]: Witness Printer took 163.49ms. Allocated memory is still 1.2GB. Free memory was 966.9MB in the beginning and 957.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 13:20:06,586 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.17ms. Allocated memory is still 123.7MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.49ms. Allocated memory is still 123.7MB. Free memory was 69.2MB in the beginning and 54.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.29ms. Allocated memory is still 123.7MB. Free memory was 54.4MB in the beginning and 51.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.22ms. Allocated memory is still 123.7MB. Free memory was 51.3MB in the beginning and 47.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 673.38ms. Allocated memory was 123.7MB in the beginning and 159.4MB in the end (delta: 35.7MB). Free memory was 47.4MB in the beginning and 112.1MB in the end (delta: -64.8MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 54123.41ms. Allocated memory was 159.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 112.1MB in the beginning and 966.9MB in the end (delta: -854.8MB). Peak memory consumption was 721.1MB. Max. memory is 16.1GB. * Witness Printer took 163.49ms. Allocated memory is still 1.2GB. Free memory was 966.9MB in the beginning and 957.5MB in the end (delta: 9.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: 20.6s, OverallIterations: 29, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4138 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4117 mSDsluCounter, 12481 SdHoareTripleChecker+Invalid, 3.2s 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, 3.0s 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.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 1567 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.5s 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-11 13:20:06,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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