./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0c11a71501857fba3402e4bb377289983d3b24a383b44d5d668b185a2e73be4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:12:16,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:12:16,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:12:16,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:12:16,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:12:16,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:12:16,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:12:16,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:12:16,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:12:16,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:12:16,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:12:16,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:12:16,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:12:16,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:12:16,260 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:12:16,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:12:16,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:12:16,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:12:16,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:12:16,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:12:16,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:12:16,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:12:16,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:12:16,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:12:16,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:12:16,266 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:12:16,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:12:16,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:12:16,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:12:16,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:12:16,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:12:16,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:12:16,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:12:16,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:12:16,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:12:16,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:12:16,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:12:16,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:12:16,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:12:16,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:12:16,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:12:16,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:12:16,273 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0c11a71501857fba3402e4bb377289983d3b24a383b44d5d668b185a2e73be4 [2024-11-16 18:12:16,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:12:16,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:12:16,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:12:16,518 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:12:16,519 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:12:16,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i [2024-11-16 18:12:17,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:12:18,193 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:12:18,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i [2024-11-16 18:12:18,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d12ea79f/d44471bf0af94a20bca5ff47092ebfc1/FLAG0fb0664e9 [2024-11-16 18:12:18,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d12ea79f/d44471bf0af94a20bca5ff47092ebfc1 [2024-11-16 18:12:18,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:12:18,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:12:18,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:12:18,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:12:18,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:12:18,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:18,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@529058ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18, skipping insertion in model container [2024-11-16 18:12:18,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:18,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:12:18,740 WARN L250 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-4.i[915,928] [2024-11-16 18:12:18,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:12:18,828 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:12:18,842 WARN L250 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-4.i[915,928] [2024-11-16 18:12:18,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:12:18,948 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:12:18,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18 WrapperNode [2024-11-16 18:12:18,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:12:18,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:12:18,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:12:18,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:12:18,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:18,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:19,028 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2024-11-16 18:12:19,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:12:19,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:12:19,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:12:19,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:12:19,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:19,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:19,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:19,069 INFO L175 MemorySlicer]: Split 130 memory accesses to 6 slices as follows [2, 38, 11, 55, 12, 12]. 42 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 4, 1, 4, 2, 2]. The 15 writes are split as follows [0, 4, 1, 5, 3, 2]. [2024-11-16 18:12:19,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:19,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:19,091 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:19,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:19,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:19,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:19,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:12:19,106 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:12:19,107 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:12:19,107 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:12:19,112 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (1/1) ... [2024-11-16 18:12:19,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:12:19,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:12:19,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:12:19,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:12:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:12:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-16 18:12:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-16 18:12:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-16 18:12:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-16 18:12:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-16 18:12:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-16 18:12:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 18:12:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 18:12:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 18:12:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 18:12:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-16 18:12:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-16 18:12:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 18:12:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 18:12:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-16 18:12:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-16 18:12:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-16 18:12:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-16 18:12:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 18:12:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 18:12:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 18:12:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 18:12:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-16 18:12:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-16 18:12:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-16 18:12:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-16 18:12:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-16 18:12:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-16 18:12:19,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-16 18:12:19,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-16 18:12:19,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:12:19,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:12:19,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:12:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 18:12:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 18:12:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 18:12:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-16 18:12:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-16 18:12:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:12:19,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:12:19,358 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:12:19,360 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:12:19,785 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite102#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~ite119#1;havoc property_#t~mem112#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite111#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite137#1;havoc property_#t~mem133#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2024-11-16 18:12:19,848 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-16 18:12:19,848 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:12:19,864 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:12:19,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:12:19,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:12:19 BoogieIcfgContainer [2024-11-16 18:12:19,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:12:19,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:12:19,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:12:19,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:12:19,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:12:18" (1/3) ... [2024-11-16 18:12:19,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ebadf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:12:19, skipping insertion in model container [2024-11-16 18:12:19,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:12:18" (2/3) ... [2024-11-16 18:12:19,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ebadf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:12:19, skipping insertion in model container [2024-11-16 18:12:19,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:12:19" (3/3) ... [2024-11-16 18:12:19,872 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-4.i [2024-11-16 18:12:19,884 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:12:19,884 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:12:19,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:12:19,944 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;@19629af0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:12:19,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:12:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 96 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:12:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 18:12:19,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:19,962 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:19,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:19,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:19,968 INFO L85 PathProgramCache]: Analyzing trace with hash -189570266, now seen corresponding path program 1 times [2024-11-16 18:12:19,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:19,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434385278] [2024-11-16 18:12:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:20,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434385278] [2024-11-16 18:12:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434385278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:20,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:20,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:12:20,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765446040] [2024-11-16 18:12:20,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:20,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:12:20,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:20,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:12:20,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:12:20,463 INFO L87 Difference]: Start difference. First operand has 113 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 96 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:20,536 INFO L93 Difference]: Finished difference Result 218 states and 336 transitions. [2024-11-16 18:12:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:12:20,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-11-16 18:12:20,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:20,559 INFO L225 Difference]: With dead ends: 218 [2024-11-16 18:12:20,559 INFO L226 Difference]: Without dead ends: 108 [2024-11-16 18:12:20,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-11-16 18:12:20,590 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:20,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:12:20,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-16 18:12:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-16 18:12:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:12:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-16 18:12:20,656 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 132 [2024-11-16 18:12:20,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:20,657 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-16 18:12:20,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-16 18:12:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 18:12:20,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:20,663 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:20,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:12:20,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:20,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1306522245, now seen corresponding path program 1 times [2024-11-16 18:12:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:20,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138423205] [2024-11-16 18:12:20,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:21,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:21,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138423205] [2024-11-16 18:12:21,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138423205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:21,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:21,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:12:21,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120151861] [2024-11-16 18:12:21,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:21,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:12:21,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:12:21,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:12:21,158 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:21,214 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-16 18:12:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:12:21,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-16 18:12:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:21,218 INFO L225 Difference]: With dead ends: 216 [2024-11-16 18:12:21,219 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 18:12:21,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-11-16 18:12:21,222 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:21,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 450 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:12:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 18:12:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-16 18:12:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:12:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-16 18:12:21,241 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 132 [2024-11-16 18:12:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:21,242 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-16 18:12:21,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-16 18:12:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 18:12:21,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:21,245 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:21,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:12:21,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:21,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:21,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1277893094, now seen corresponding path program 1 times [2024-11-16 18:12:21,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:21,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280682214] [2024-11-16 18:12:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:21,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:22,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:22,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280682214] [2024-11-16 18:12:22,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280682214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:22,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:22,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:12:22,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022074838] [2024-11-16 18:12:22,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:22,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:12:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:22,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:12:22,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:12:22,161 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:22,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:22,555 INFO L93 Difference]: Finished difference Result 288 states and 417 transitions. [2024-11-16 18:12:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:12:22,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-16 18:12:22,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:22,558 INFO L225 Difference]: With dead ends: 288 [2024-11-16 18:12:22,558 INFO L226 Difference]: Without dead ends: 181 [2024-11-16 18:12:22,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:12:22,563 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 145 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:22,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 881 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:12:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-16 18:12:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 112. [2024-11-16 18:12:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:12:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-16 18:12:22,585 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 132 [2024-11-16 18:12:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:22,588 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-16 18:12:22,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-16 18:12:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 18:12:22,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:22,594 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:22,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:12:22,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:22,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1148810375, now seen corresponding path program 1 times [2024-11-16 18:12:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:22,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354560471] [2024-11-16 18:12:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:22,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:22,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:22,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354560471] [2024-11-16 18:12:22,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354560471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:22,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:22,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:12:22,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391350996] [2024-11-16 18:12:22,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:22,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:12:22,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:22,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:12:22,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:12:22,815 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:22,833 INFO L93 Difference]: Finished difference Result 223 states and 320 transitions. [2024-11-16 18:12:22,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:12:22,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-16 18:12:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:22,835 INFO L225 Difference]: With dead ends: 223 [2024-11-16 18:12:22,835 INFO L226 Difference]: Without dead ends: 114 [2024-11-16 18:12:22,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-11-16 18:12:22,836 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:22,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:12:22,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-16 18:12:22,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-16 18:12:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:12:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-16 18:12:22,849 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 132 [2024-11-16 18:12:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:22,851 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-16 18:12:22,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-16 18:12:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 18:12:22,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:22,854 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:22,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:12:22,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:22,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1085804193, now seen corresponding path program 1 times [2024-11-16 18:12:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:22,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538967371] [2024-11-16 18:12:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:22,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:23,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:23,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538967371] [2024-11-16 18:12:23,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538967371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:23,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:23,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:12:23,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592298857] [2024-11-16 18:12:23,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:23,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:12:23,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:23,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:12:23,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:12:23,108 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:23,137 INFO L93 Difference]: Finished difference Result 228 states and 325 transitions. [2024-11-16 18:12:23,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:12:23,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-16 18:12:23,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:23,139 INFO L225 Difference]: With dead ends: 228 [2024-11-16 18:12:23,139 INFO L226 Difference]: Without dead ends: 117 [2024-11-16 18:12:23,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-11-16 18:12:23,140 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:23,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:12:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-16 18:12:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2024-11-16 18:12:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:12:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-16 18:12:23,147 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 134 [2024-11-16 18:12:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:23,147 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-16 18:12:23,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-16 18:12:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:12:23,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:23,149 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:23,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:12:23,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:23,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash -991590307, now seen corresponding path program 1 times [2024-11-16 18:12:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:23,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753219991] [2024-11-16 18:12:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:24,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:24,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753219991] [2024-11-16 18:12:24,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753219991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:24,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:24,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:12:24,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996361146] [2024-11-16 18:12:24,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:24,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:12:24,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:24,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:12:24,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:12:24,202 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:24,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:24,809 INFO L93 Difference]: Finished difference Result 390 states and 556 transitions. [2024-11-16 18:12:24,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:12:24,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-16 18:12:24,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:24,812 INFO L225 Difference]: With dead ends: 390 [2024-11-16 18:12:24,812 INFO L226 Difference]: Without dead ends: 278 [2024-11-16 18:12:24,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:12:24,814 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 240 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:24,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 784 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:12:24,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-16 18:12:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 210. [2024-11-16 18:12:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 181 states have (on average 1.3646408839779005) internal successors, (247), 182 states have internal predecessors, (247), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 18:12:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 299 transitions. [2024-11-16 18:12:24,839 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 299 transitions. Word has length 136 [2024-11-16 18:12:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:24,841 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 299 transitions. [2024-11-16 18:12:24,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 299 transitions. [2024-11-16 18:12:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:12:24,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:24,843 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:24,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:12:24,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:24,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1502124484, now seen corresponding path program 1 times [2024-11-16 18:12:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:24,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366732585] [2024-11-16 18:12:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:25,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:25,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366732585] [2024-11-16 18:12:25,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366732585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:25,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:25,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:12:25,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815579791] [2024-11-16 18:12:25,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:25,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:12:25,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:25,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:12:25,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:12:25,947 INFO L87 Difference]: Start difference. First operand 210 states and 299 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:26,200 INFO L93 Difference]: Finished difference Result 552 states and 783 transitions. [2024-11-16 18:12:26,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:12:26,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-11-16 18:12:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:26,205 INFO L225 Difference]: With dead ends: 552 [2024-11-16 18:12:26,205 INFO L226 Difference]: Without dead ends: 345 [2024-11-16 18:12:26,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:12:26,208 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 93 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:26,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 515 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:12:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-16 18:12:26,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 340. [2024-11-16 18:12:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 297 states have (on average 1.3636363636363635) internal successors, (405), 300 states have internal predecessors, (405), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 18:12:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 481 transitions. [2024-11-16 18:12:26,240 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 481 transitions. Word has length 136 [2024-11-16 18:12:26,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:26,241 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 481 transitions. [2024-11-16 18:12:26,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 481 transitions. [2024-11-16 18:12:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:12:26,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:26,243 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:26,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:12:26,243 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:26,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2143080642, now seen corresponding path program 1 times [2024-11-16 18:12:26,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:26,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684925036] [2024-11-16 18:12:26,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:26,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:27,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:27,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684925036] [2024-11-16 18:12:27,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684925036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:27,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:27,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:12:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150748514] [2024-11-16 18:12:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:27,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:12:27,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:27,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:12:27,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:12:27,941 INFO L87 Difference]: Start difference. First operand 340 states and 481 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:28,610 INFO L93 Difference]: Finished difference Result 749 states and 1055 transitions. [2024-11-16 18:12:28,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:12:28,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 136 [2024-11-16 18:12:28,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:28,615 INFO L225 Difference]: With dead ends: 749 [2024-11-16 18:12:28,615 INFO L226 Difference]: Without dead ends: 412 [2024-11-16 18:12:28,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:12:28,617 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 227 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:28,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 623 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:12:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-16 18:12:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 369. [2024-11-16 18:12:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 326 states have (on average 1.352760736196319) internal successors, (441), 329 states have internal predecessors, (441), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 18:12:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 517 transitions. [2024-11-16 18:12:28,650 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 517 transitions. Word has length 136 [2024-11-16 18:12:28,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:28,650 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 517 transitions. [2024-11-16 18:12:28,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 517 transitions. [2024-11-16 18:12:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:12:28,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:28,652 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:28,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:12:28,653 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:28,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1398232638, now seen corresponding path program 1 times [2024-11-16 18:12:28,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:28,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904556618] [2024-11-16 18:12:28,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:28,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:29,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:29,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904556618] [2024-11-16 18:12:29,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904556618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:29,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:29,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:12:29,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534147808] [2024-11-16 18:12:29,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:29,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:12:29,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:29,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:12:29,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:12:29,836 INFO L87 Difference]: Start difference. First operand 369 states and 517 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:30,392 INFO L93 Difference]: Finished difference Result 747 states and 1044 transitions. [2024-11-16 18:12:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:12:30,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-16 18:12:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:30,396 INFO L225 Difference]: With dead ends: 747 [2024-11-16 18:12:30,396 INFO L226 Difference]: Without dead ends: 381 [2024-11-16 18:12:30,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:12:30,397 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 118 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:30,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1558 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:12:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-16 18:12:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2024-11-16 18:12:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 334 states have (on average 1.344311377245509) internal successors, (449), 337 states have internal predecessors, (449), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 18:12:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 525 transitions. [2024-11-16 18:12:30,428 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 525 transitions. Word has length 136 [2024-11-16 18:12:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:30,429 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 525 transitions. [2024-11-16 18:12:30,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 525 transitions. [2024-11-16 18:12:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:12:30,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:30,432 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:30,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:12:30,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:30,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1269149919, now seen corresponding path program 1 times [2024-11-16 18:12:30,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:30,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691485278] [2024-11-16 18:12:30,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:30,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:31,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:31,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691485278] [2024-11-16 18:12:31,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691485278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:31,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:31,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:12:31,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096806415] [2024-11-16 18:12:31,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:31,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:12:31,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:12:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:12:31,321 INFO L87 Difference]: Start difference. First operand 377 states and 525 transitions. Second operand has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:31,683 INFO L93 Difference]: Finished difference Result 750 states and 1043 transitions. [2024-11-16 18:12:31,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:12:31,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 136 [2024-11-16 18:12:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:31,685 INFO L225 Difference]: With dead ends: 750 [2024-11-16 18:12:31,685 INFO L226 Difference]: Without dead ends: 376 [2024-11-16 18:12:31,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:12:31,687 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 108 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:31,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 988 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:12:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-16 18:12:31,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2024-11-16 18:12:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 329 states have (on average 1.3404255319148937) internal successors, (441), 332 states have internal predecessors, (441), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 18:12:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 517 transitions. [2024-11-16 18:12:31,724 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 517 transitions. Word has length 136 [2024-11-16 18:12:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:31,724 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 517 transitions. [2024-11-16 18:12:31,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 517 transitions. [2024-11-16 18:12:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:12:31,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:31,726 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:31,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:12:31,726 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:31,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:31,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1367212831, now seen corresponding path program 1 times [2024-11-16 18:12:31,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:31,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432684233] [2024-11-16 18:12:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:31,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:32,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:32,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432684233] [2024-11-16 18:12:32,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432684233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:32,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:32,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:12:32,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396596196] [2024-11-16 18:12:32,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:32,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:12:32,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:32,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:12:32,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:12:32,553 INFO L87 Difference]: Start difference. First operand 373 states and 517 transitions. Second operand has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:32,928 INFO L93 Difference]: Finished difference Result 865 states and 1203 transitions. [2024-11-16 18:12:32,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:12:32,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 136 [2024-11-16 18:12:32,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:32,931 INFO L225 Difference]: With dead ends: 865 [2024-11-16 18:12:32,932 INFO L226 Difference]: Without dead ends: 495 [2024-11-16 18:12:32,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:12:32,936 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 111 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:32,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 823 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:12:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-16 18:12:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 491. [2024-11-16 18:12:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 430 states have (on average 1.344186046511628) internal successors, (578), 435 states have internal predecessors, (578), 53 states have call successors, (53), 7 states have call predecessors, (53), 7 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-16 18:12:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 684 transitions. [2024-11-16 18:12:32,990 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 684 transitions. Word has length 136 [2024-11-16 18:12:32,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:32,991 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 684 transitions. [2024-11-16 18:12:32,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 684 transitions. [2024-11-16 18:12:32,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:12:32,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:32,994 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:32,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:12:32,994 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:32,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:32,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1238130112, now seen corresponding path program 1 times [2024-11-16 18:12:32,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:32,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189027380] [2024-11-16 18:12:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:32,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:33,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:33,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189027380] [2024-11-16 18:12:33,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189027380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:33,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:33,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:12:33,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243799545] [2024-11-16 18:12:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:33,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:12:33,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:12:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:12:33,925 INFO L87 Difference]: Start difference. First operand 491 states and 684 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:34,452 INFO L93 Difference]: Finished difference Result 983 states and 1369 transitions. [2024-11-16 18:12:34,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 18:12:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-16 18:12:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:34,456 INFO L225 Difference]: With dead ends: 983 [2024-11-16 18:12:34,456 INFO L226 Difference]: Without dead ends: 495 [2024-11-16 18:12:34,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:12:34,457 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 113 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:34,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1492 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:12:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-16 18:12:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 491. [2024-11-16 18:12:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 430 states have (on average 1.341860465116279) internal successors, (577), 435 states have internal predecessors, (577), 53 states have call successors, (53), 7 states have call predecessors, (53), 7 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-16 18:12:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 683 transitions. [2024-11-16 18:12:34,494 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 683 transitions. Word has length 136 [2024-11-16 18:12:34,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:34,494 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 683 transitions. [2024-11-16 18:12:34,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 683 transitions. [2024-11-16 18:12:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:12:34,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:34,496 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:34,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 18:12:34,496 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:34,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2099745862, now seen corresponding path program 1 times [2024-11-16 18:12:34,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:34,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719722906] [2024-11-16 18:12:34,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:34,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:35,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:35,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719722906] [2024-11-16 18:12:35,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719722906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:35,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:35,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:12:35,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714932719] [2024-11-16 18:12:35,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:35,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:12:35,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:35,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:12:35,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:12:35,390 INFO L87 Difference]: Start difference. First operand 491 states and 683 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:35,962 INFO L93 Difference]: Finished difference Result 1195 states and 1665 transitions. [2024-11-16 18:12:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 18:12:35,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-16 18:12:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:35,967 INFO L225 Difference]: With dead ends: 1195 [2024-11-16 18:12:35,967 INFO L226 Difference]: Without dead ends: 707 [2024-11-16 18:12:35,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:12:35,969 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 120 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:35,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1408 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:12:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-16 18:12:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 589. [2024-11-16 18:12:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 517 states have (on average 1.3423597678916828) internal successors, (694), 523 states have internal predecessors, (694), 62 states have call successors, (62), 9 states have call predecessors, (62), 9 states have return successors, (62), 56 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-16 18:12:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 818 transitions. [2024-11-16 18:12:36,016 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 818 transitions. Word has length 136 [2024-11-16 18:12:36,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:36,017 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 818 transitions. [2024-11-16 18:12:36,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 818 transitions. [2024-11-16 18:12:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:12:36,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:36,019 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:36,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 18:12:36,019 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:36,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1970663143, now seen corresponding path program 1 times [2024-11-16 18:12:36,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:36,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290786830] [2024-11-16 18:12:36,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:36,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:36,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290786830] [2024-11-16 18:12:36,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290786830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:36,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:36,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:12:36,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585677861] [2024-11-16 18:12:36,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:36,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:12:36,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:36,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:12:36,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:12:36,766 INFO L87 Difference]: Start difference. First operand 589 states and 818 transitions. Second operand has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:37,236 INFO L93 Difference]: Finished difference Result 1243 states and 1729 transitions. [2024-11-16 18:12:37,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:12:37,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 136 [2024-11-16 18:12:37,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:37,242 INFO L225 Difference]: With dead ends: 1243 [2024-11-16 18:12:37,242 INFO L226 Difference]: Without dead ends: 705 [2024-11-16 18:12:37,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:12:37,244 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 113 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:37,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1089 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:12:37,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-16 18:12:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 587. [2024-11-16 18:12:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 515 states have (on average 1.3398058252427185) internal successors, (690), 521 states have internal predecessors, (690), 62 states have call successors, (62), 9 states have call predecessors, (62), 9 states have return successors, (62), 56 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-16 18:12:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 814 transitions. [2024-11-16 18:12:37,305 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 814 transitions. Word has length 136 [2024-11-16 18:12:37,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:37,306 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 814 transitions. [2024-11-16 18:12:37,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 814 transitions. [2024-11-16 18:12:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:12:37,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:37,308 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:37,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 18:12:37,309 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:37,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1354897858, now seen corresponding path program 1 times [2024-11-16 18:12:37,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:37,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660016760] [2024-11-16 18:12:37,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:37,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:38,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:38,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660016760] [2024-11-16 18:12:38,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660016760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:38,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:38,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:12:38,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141280565] [2024-11-16 18:12:38,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:38,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:12:38,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:38,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:12:38,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:12:38,476 INFO L87 Difference]: Start difference. First operand 587 states and 814 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:40,026 INFO L93 Difference]: Finished difference Result 1446 states and 1981 transitions. [2024-11-16 18:12:40,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:12:40,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 136 [2024-11-16 18:12:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:40,032 INFO L225 Difference]: With dead ends: 1446 [2024-11-16 18:12:40,032 INFO L226 Difference]: Without dead ends: 910 [2024-11-16 18:12:40,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:12:40,034 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 220 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:40,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1080 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 18:12:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-16 18:12:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 675. [2024-11-16 18:12:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 596 states have (on average 1.3338926174496644) internal successors, (795), 601 states have internal predecessors, (795), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-16 18:12:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 931 transitions. [2024-11-16 18:12:40,081 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 931 transitions. Word has length 136 [2024-11-16 18:12:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:40,081 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 931 transitions. [2024-11-16 18:12:40,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 931 transitions. [2024-11-16 18:12:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:12:40,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:40,083 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:40,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 18:12:40,083 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:40,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2068726055, now seen corresponding path program 1 times [2024-11-16 18:12:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:40,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839967802] [2024-11-16 18:12:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:40,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:40,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839967802] [2024-11-16 18:12:40,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839967802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:40,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:40,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:12:40,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544559483] [2024-11-16 18:12:40,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:40,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:12:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:12:40,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:12:40,804 INFO L87 Difference]: Start difference. First operand 675 states and 931 transitions. Second operand has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:41,175 INFO L93 Difference]: Finished difference Result 1219 states and 1681 transitions. [2024-11-16 18:12:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:12:41,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 136 [2024-11-16 18:12:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:41,179 INFO L225 Difference]: With dead ends: 1219 [2024-11-16 18:12:41,179 INFO L226 Difference]: Without dead ends: 683 [2024-11-16 18:12:41,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:12:41,182 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 115 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:41,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 830 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:12:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-16 18:12:41,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 561. [2024-11-16 18:12:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 498 states have (on average 1.319277108433735) internal successors, (657), 501 states have internal predecessors, (657), 53 states have call successors, (53), 9 states have call predecessors, (53), 9 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-16 18:12:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 763 transitions. [2024-11-16 18:12:41,224 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 763 transitions. Word has length 136 [2024-11-16 18:12:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:41,224 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 763 transitions. [2024-11-16 18:12:41,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 763 transitions. [2024-11-16 18:12:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:12:41,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:41,226 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:41,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 18:12:41,226 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:41,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1939643336, now seen corresponding path program 1 times [2024-11-16 18:12:41,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:41,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780989557] [2024-11-16 18:12:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:41,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:42,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:42,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780989557] [2024-11-16 18:12:42,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780989557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:42,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:42,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:12:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648704426] [2024-11-16 18:12:42,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:42,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:12:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:42,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:12:42,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:12:42,041 INFO L87 Difference]: Start difference. First operand 561 states and 763 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:42,624 INFO L93 Difference]: Finished difference Result 1119 states and 1528 transitions. [2024-11-16 18:12:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:12:42,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-16 18:12:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:42,628 INFO L225 Difference]: With dead ends: 1119 [2024-11-16 18:12:42,628 INFO L226 Difference]: Without dead ends: 697 [2024-11-16 18:12:42,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:12:42,630 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 121 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:42,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1924 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:12:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-16 18:12:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 571. [2024-11-16 18:12:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 508 states have (on average 1.3188976377952757) internal successors, (670), 511 states have internal predecessors, (670), 53 states have call successors, (53), 9 states have call predecessors, (53), 9 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-16 18:12:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 776 transitions. [2024-11-16 18:12:42,671 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 776 transitions. Word has length 136 [2024-11-16 18:12:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:42,671 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 776 transitions. [2024-11-16 18:12:42,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 776 transitions. [2024-11-16 18:12:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-16 18:12:42,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:42,674 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:42,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 18:12:42,674 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:42,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash 58925236, now seen corresponding path program 1 times [2024-11-16 18:12:42,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:42,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701293350] [2024-11-16 18:12:42,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:42,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:43,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:43,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701293350] [2024-11-16 18:12:43,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701293350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:43,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:43,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:12:43,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994496827] [2024-11-16 18:12:43,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:43,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:12:43,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:43,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:12:43,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:12:43,148 INFO L87 Difference]: Start difference. First operand 571 states and 776 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:43,521 INFO L93 Difference]: Finished difference Result 1208 states and 1637 transitions. [2024-11-16 18:12:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:12:43,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2024-11-16 18:12:43,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:43,526 INFO L225 Difference]: With dead ends: 1208 [2024-11-16 18:12:43,526 INFO L226 Difference]: Without dead ends: 756 [2024-11-16 18:12:43,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:12:43,528 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 219 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:43,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 937 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:12:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-16 18:12:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 595. [2024-11-16 18:12:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 532 states have (on average 1.3157894736842106) internal successors, (700), 535 states have internal predecessors, (700), 53 states have call successors, (53), 9 states have call predecessors, (53), 9 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-16 18:12:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 806 transitions. [2024-11-16 18:12:43,598 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 806 transitions. Word has length 137 [2024-11-16 18:12:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:43,599 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 806 transitions. [2024-11-16 18:12:43,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 806 transitions. [2024-11-16 18:12:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 18:12:43,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:43,602 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:43,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 18:12:43,602 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:43,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:43,603 INFO L85 PathProgramCache]: Analyzing trace with hash -650351306, now seen corresponding path program 1 times [2024-11-16 18:12:43,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:43,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472460943] [2024-11-16 18:12:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:43,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:44,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:44,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472460943] [2024-11-16 18:12:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472460943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:44,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:44,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:12:44,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257877570] [2024-11-16 18:12:44,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:44,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:12:44,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:44,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:12:44,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:12:44,199 INFO L87 Difference]: Start difference. First operand 595 states and 806 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:44,808 INFO L93 Difference]: Finished difference Result 1189 states and 1615 transitions. [2024-11-16 18:12:44,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:12:44,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2024-11-16 18:12:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:44,812 INFO L225 Difference]: With dead ends: 1189 [2024-11-16 18:12:44,812 INFO L226 Difference]: Without dead ends: 741 [2024-11-16 18:12:44,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:12:44,814 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 230 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:44,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 789 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:12:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-16 18:12:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 729. [2024-11-16 18:12:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 641 states have (on average 1.3151326053042123) internal successors, (843), 646 states have internal predecessors, (843), 74 states have call successors, (74), 13 states have call predecessors, (74), 13 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-16 18:12:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 991 transitions. [2024-11-16 18:12:44,885 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 991 transitions. Word has length 139 [2024-11-16 18:12:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:44,886 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 991 transitions. [2024-11-16 18:12:44,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 991 transitions. [2024-11-16 18:12:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 18:12:44,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:44,888 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:44,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 18:12:44,888 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:44,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash -439000393, now seen corresponding path program 1 times [2024-11-16 18:12:44,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:44,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032516237] [2024-11-16 18:12:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:45,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:45,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032516237] [2024-11-16 18:12:45,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032516237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:45,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:45,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:12:45,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386419681] [2024-11-16 18:12:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:45,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:12:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:45,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:12:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:12:45,940 INFO L87 Difference]: Start difference. First operand 729 states and 991 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:47,413 INFO L93 Difference]: Finished difference Result 1874 states and 2548 transitions. [2024-11-16 18:12:47,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-16 18:12:47,413 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2024-11-16 18:12:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:47,419 INFO L225 Difference]: With dead ends: 1874 [2024-11-16 18:12:47,419 INFO L226 Difference]: Without dead ends: 1286 [2024-11-16 18:12:47,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2024-11-16 18:12:47,422 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 402 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 2228 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:47,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 2228 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 18:12:47,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2024-11-16 18:12:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 760. [2024-11-16 18:12:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 668 states have (on average 1.3203592814371257) internal successors, (882), 673 states have internal predecessors, (882), 77 states have call successors, (77), 14 states have call predecessors, (77), 14 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-16 18:12:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1036 transitions. [2024-11-16 18:12:47,510 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1036 transitions. Word has length 139 [2024-11-16 18:12:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:47,511 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1036 transitions. [2024-11-16 18:12:47,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1036 transitions. [2024-11-16 18:12:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 18:12:47,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:47,513 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:47,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 18:12:47,513 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:47,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:47,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1912794969, now seen corresponding path program 1 times [2024-11-16 18:12:47,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:47,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475785893] [2024-11-16 18:12:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:47,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:48,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:48,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475785893] [2024-11-16 18:12:48,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475785893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:48,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:48,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:12:48,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112803860] [2024-11-16 18:12:48,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:48,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:12:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:48,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:12:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:12:48,487 INFO L87 Difference]: Start difference. First operand 760 states and 1036 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:49,210 INFO L93 Difference]: Finished difference Result 1053 states and 1435 transitions. [2024-11-16 18:12:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 18:12:49,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2024-11-16 18:12:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:49,216 INFO L225 Difference]: With dead ends: 1053 [2024-11-16 18:12:49,216 INFO L226 Difference]: Without dead ends: 1050 [2024-11-16 18:12:49,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-16 18:12:49,218 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 503 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:49,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1123 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:12:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-11-16 18:12:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 564. [2024-11-16 18:12:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 508 states have (on average 1.312992125984252) internal successors, (667), 510 states have internal predecessors, (667), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:12:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 757 transitions. [2024-11-16 18:12:49,288 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 757 transitions. Word has length 139 [2024-11-16 18:12:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:49,289 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 757 transitions. [2024-11-16 18:12:49,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 757 transitions. [2024-11-16 18:12:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 18:12:49,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:49,292 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:49,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 18:12:49,292 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:49,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:49,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1884165818, now seen corresponding path program 1 times [2024-11-16 18:12:49,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:49,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367735425] [2024-11-16 18:12:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:50,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367735425] [2024-11-16 18:12:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367735425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:50,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:50,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:12:50,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238048447] [2024-11-16 18:12:50,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:50,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:12:50,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:50,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:12:50,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:12:50,379 INFO L87 Difference]: Start difference. First operand 564 states and 757 transitions. Second operand has 9 states, 7 states have (on average 9.571428571428571) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:50,861 INFO L93 Difference]: Finished difference Result 1403 states and 1880 transitions. [2024-11-16 18:12:50,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:12:50,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.571428571428571) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 139 [2024-11-16 18:12:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:50,868 INFO L225 Difference]: With dead ends: 1403 [2024-11-16 18:12:50,869 INFO L226 Difference]: Without dead ends: 1002 [2024-11-16 18:12:50,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:12:50,870 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 105 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:50,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1280 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:12:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2024-11-16 18:12:50,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 828. [2024-11-16 18:12:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 772 states have (on average 1.3082901554404145) internal successors, (1010), 774 states have internal predecessors, (1010), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:12:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1100 transitions. [2024-11-16 18:12:50,942 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1100 transitions. Word has length 139 [2024-11-16 18:12:50,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:50,943 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1100 transitions. [2024-11-16 18:12:50,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.571428571428571) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1100 transitions. [2024-11-16 18:12:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 18:12:50,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:50,945 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:50,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 18:12:50,945 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:50,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:50,945 INFO L85 PathProgramCache]: Analyzing trace with hash 553284568, now seen corresponding path program 1 times [2024-11-16 18:12:50,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:50,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037321213] [2024-11-16 18:12:50,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:50,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:51,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:51,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037321213] [2024-11-16 18:12:51,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037321213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:51,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:51,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:12:51,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528459320] [2024-11-16 18:12:51,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:51,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:12:51,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:51,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:12:51,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:12:51,674 INFO L87 Difference]: Start difference. First operand 828 states and 1100 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:52,588 INFO L93 Difference]: Finished difference Result 1766 states and 2331 transitions. [2024-11-16 18:12:52,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 18:12:52,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-16 18:12:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:52,594 INFO L225 Difference]: With dead ends: 1766 [2024-11-16 18:12:52,594 INFO L226 Difference]: Without dead ends: 1177 [2024-11-16 18:12:52,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:12:52,596 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 275 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:52,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1912 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:12:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2024-11-16 18:12:52,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 828. [2024-11-16 18:12:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 772 states have (on average 1.3082901554404145) internal successors, (1010), 774 states have internal predecessors, (1010), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:12:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1100 transitions. [2024-11-16 18:12:52,671 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1100 transitions. Word has length 139 [2024-11-16 18:12:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:52,671 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1100 transitions. [2024-11-16 18:12:52,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:52,671 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1100 transitions. [2024-11-16 18:12:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 18:12:52,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:52,673 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:52,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 18:12:52,674 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:52,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash 42750391, now seen corresponding path program 1 times [2024-11-16 18:12:52,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:52,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10621525] [2024-11-16 18:12:52,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:52,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:53,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:53,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10621525] [2024-11-16 18:12:53,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10621525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:53,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:53,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:12:53,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433502789] [2024-11-16 18:12:53,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:53,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:12:53,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:53,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:12:53,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:12:53,588 INFO L87 Difference]: Start difference. First operand 828 states and 1100 transitions. Second operand has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:54,325 INFO L93 Difference]: Finished difference Result 1706 states and 2263 transitions. [2024-11-16 18:12:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 18:12:54,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 139 [2024-11-16 18:12:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:54,331 INFO L225 Difference]: With dead ends: 1706 [2024-11-16 18:12:54,331 INFO L226 Difference]: Without dead ends: 1117 [2024-11-16 18:12:54,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-11-16 18:12:54,333 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 258 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:54,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1506 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:12:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-11-16 18:12:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 828. [2024-11-16 18:12:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 772 states have (on average 1.305699481865285) internal successors, (1008), 774 states have internal predecessors, (1008), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:12:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1098 transitions. [2024-11-16 18:12:54,427 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1098 transitions. Word has length 139 [2024-11-16 18:12:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:54,428 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1098 transitions. [2024-11-16 18:12:54,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:12:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1098 transitions. [2024-11-16 18:12:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 18:12:54,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:54,429 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:54,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 18:12:54,430 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:54,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:54,430 INFO L85 PathProgramCache]: Analyzing trace with hash 764635481, now seen corresponding path program 1 times [2024-11-16 18:12:54,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295468287] [2024-11-16 18:12:54,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:54,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:54,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295468287] [2024-11-16 18:12:54,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295468287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:54,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:54,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:12:54,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411880240] [2024-11-16 18:12:54,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:54,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:12:54,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:54,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:12:54,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:12:54,848 INFO L87 Difference]: Start difference. First operand 828 states and 1098 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:55,369 INFO L93 Difference]: Finished difference Result 1688 states and 2235 transitions. [2024-11-16 18:12:55,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:12:55,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-16 18:12:55,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:55,379 INFO L225 Difference]: With dead ends: 1688 [2024-11-16 18:12:55,382 INFO L226 Difference]: Without dead ends: 1099 [2024-11-16 18:12:55,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:12:55,384 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 259 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:55,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 727 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:12:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2024-11-16 18:12:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 816. [2024-11-16 18:12:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 760 states have (on average 1.3026315789473684) internal successors, (990), 762 states have internal predecessors, (990), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:12:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1080 transitions. [2024-11-16 18:12:55,465 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1080 transitions. Word has length 139 [2024-11-16 18:12:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:55,465 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1080 transitions. [2024-11-16 18:12:55,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1080 transitions. [2024-11-16 18:12:55,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 18:12:55,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:55,467 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:55,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 18:12:55,468 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:55,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:55,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1938542245, now seen corresponding path program 1 times [2024-11-16 18:12:55,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:55,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350786361] [2024-11-16 18:12:55,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:55,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:55,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:55,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350786361] [2024-11-16 18:12:55,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350786361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:55,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:55,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:12:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662188727] [2024-11-16 18:12:55,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:55,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:12:55,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:55,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:12:55,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:12:55,988 INFO L87 Difference]: Start difference. First operand 816 states and 1080 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:56,684 INFO L93 Difference]: Finished difference Result 1599 states and 2111 transitions. [2024-11-16 18:12:56,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:12:56,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2024-11-16 18:12:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:56,688 INFO L225 Difference]: With dead ends: 1599 [2024-11-16 18:12:56,688 INFO L226 Difference]: Without dead ends: 988 [2024-11-16 18:12:56,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:12:56,689 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 240 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:56,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1086 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:12:56,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-16 18:12:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 796. [2024-11-16 18:12:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 740 states have (on average 1.2891891891891891) internal successors, (954), 742 states have internal predecessors, (954), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:12:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1044 transitions. [2024-11-16 18:12:56,773 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1044 transitions. Word has length 139 [2024-11-16 18:12:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:56,773 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1044 transitions. [2024-11-16 18:12:56,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1044 transitions. [2024-11-16 18:12:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 18:12:56,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:56,775 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:56,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 18:12:56,775 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:56,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:56,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1727191332, now seen corresponding path program 1 times [2024-11-16 18:12:56,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:56,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490796909] [2024-11-16 18:12:56,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:56,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:57,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490796909] [2024-11-16 18:12:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490796909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:57,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:57,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:12:57,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634819053] [2024-11-16 18:12:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:57,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:12:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:57,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:12:57,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:12:57,205 INFO L87 Difference]: Start difference. First operand 796 states and 1044 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:57,699 INFO L93 Difference]: Finished difference Result 1591 states and 2085 transitions. [2024-11-16 18:12:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:12:57,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-16 18:12:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:57,703 INFO L225 Difference]: With dead ends: 1591 [2024-11-16 18:12:57,703 INFO L226 Difference]: Without dead ends: 1006 [2024-11-16 18:12:57,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:12:57,704 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 297 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:57,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1166 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:12:57,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2024-11-16 18:12:57,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 786. [2024-11-16 18:12:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 730 states have (on average 1.2821917808219179) internal successors, (936), 732 states have internal predecessors, (936), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:12:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1026 transitions. [2024-11-16 18:12:57,777 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1026 transitions. Word has length 139 [2024-11-16 18:12:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:57,778 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1026 transitions. [2024-11-16 18:12:57,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:12:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1026 transitions. [2024-11-16 18:12:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 18:12:57,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:57,779 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:57,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 18:12:57,780 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:57,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:57,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1245440548, now seen corresponding path program 1 times [2024-11-16 18:12:57,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:57,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701446460] [2024-11-16 18:12:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:57,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:58,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:58,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701446460] [2024-11-16 18:12:58,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701446460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:58,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:58,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:12:58,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988005922] [2024-11-16 18:12:58,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:58,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:12:58,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:58,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:12:58,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:12:58,405 INFO L87 Difference]: Start difference. First operand 786 states and 1026 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:58,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:12:58,940 INFO L93 Difference]: Finished difference Result 1547 states and 2021 transitions. [2024-11-16 18:12:58,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:12:58,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2024-11-16 18:12:58,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:12:58,943 INFO L225 Difference]: With dead ends: 1547 [2024-11-16 18:12:58,944 INFO L226 Difference]: Without dead ends: 944 [2024-11-16 18:12:58,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:12:58,945 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 240 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:12:58,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 926 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:12:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-16 18:12:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 766. [2024-11-16 18:12:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 710 states have (on average 1.267605633802817) internal successors, (900), 712 states have internal predecessors, (900), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:12:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 990 transitions. [2024-11-16 18:12:59,034 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 990 transitions. Word has length 139 [2024-11-16 18:12:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:12:59,034 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 990 transitions. [2024-11-16 18:12:59,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:12:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 990 transitions. [2024-11-16 18:12:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 18:12:59,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:12:59,036 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:12:59,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 18:12:59,037 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:12:59,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:12:59,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1034089635, now seen corresponding path program 1 times [2024-11-16 18:12:59,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:12:59,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733391834] [2024-11-16 18:12:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:12:59,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:12:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:12:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:12:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:12:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:12:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:12:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:12:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:12:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:12:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:12:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:12:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:12:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:12:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:12:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:12:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:12:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:12:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:12:59,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:12:59,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733391834] [2024-11-16 18:12:59,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733391834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:12:59,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:12:59,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:12:59,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929002797] [2024-11-16 18:12:59,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:12:59,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:12:59,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:12:59,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:12:59,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:12:59,478 INFO L87 Difference]: Start difference. First operand 766 states and 990 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:13:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:13:00,031 INFO L93 Difference]: Finished difference Result 1598 states and 2076 transitions. [2024-11-16 18:13:00,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:13:00,031 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2024-11-16 18:13:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:13:00,036 INFO L225 Difference]: With dead ends: 1598 [2024-11-16 18:13:00,036 INFO L226 Difference]: Without dead ends: 1021 [2024-11-16 18:13:00,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:13:00,038 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 325 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:13:00,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1059 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:13:00,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-11-16 18:13:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 728. [2024-11-16 18:13:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 672 states have (on average 1.2589285714285714) internal successors, (846), 674 states have internal predecessors, (846), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:13:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 936 transitions. [2024-11-16 18:13:00,130 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 936 transitions. Word has length 139 [2024-11-16 18:13:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:13:00,131 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 936 transitions. [2024-11-16 18:13:00,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:13:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 936 transitions. [2024-11-16 18:13:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 18:13:00,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:13:00,133 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:13:00,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 18:13:00,133 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:13:00,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:13:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1713382596, now seen corresponding path program 1 times [2024-11-16 18:13:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:13:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002572702] [2024-11-16 18:13:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:13:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:13:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:13:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:13:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:13:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:13:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:13:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:13:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:13:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:13:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:13:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:13:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:13:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:13:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:13:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:13:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:13:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:13:00,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:13:00,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002572702] [2024-11-16 18:13:00,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002572702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:13:00,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:13:00,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:13:00,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583952497] [2024-11-16 18:13:00,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:13:00,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:13:00,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:13:00,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:13:00,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:13:00,788 INFO L87 Difference]: Start difference. First operand 728 states and 936 transitions. Second operand has 8 states, 6 states have (on average 11.5) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:13:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:13:01,180 INFO L93 Difference]: Finished difference Result 1409 states and 1826 transitions. [2024-11-16 18:13:01,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:13:01,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.5) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 141 [2024-11-16 18:13:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:13:01,185 INFO L225 Difference]: With dead ends: 1409 [2024-11-16 18:13:01,185 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 18:13:01,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:13:01,187 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 111 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:13:01,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1086 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:13:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 18:13:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 728. [2024-11-16 18:13:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 672 states have (on average 1.2574404761904763) internal successors, (845), 674 states have internal predecessors, (845), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:13:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 935 transitions. [2024-11-16 18:13:01,274 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 935 transitions. Word has length 141 [2024-11-16 18:13:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:13:01,275 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 935 transitions. [2024-11-16 18:13:01,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.5) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:13:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 935 transitions. [2024-11-16 18:13:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 18:13:01,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:13:01,277 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:13:01,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 18:13:01,277 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:13:01,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:13:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1744402403, now seen corresponding path program 1 times [2024-11-16 18:13:01,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:13:01,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507840348] [2024-11-16 18:13:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:13:01,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:13:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:13:01,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1023817455] [2024-11-16 18:13:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:13:01,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:13:01,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:13:01,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:13:01,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 18:13:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:01,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-16 18:13:01,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:13:01,955 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 9 treesize of output 3 [2024-11-16 18:13:02,133 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-11-16 18:13:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-16 18:13:02,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:13:03,328 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 27 treesize of output 15 [2024-11-16 18:13:03,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:13:03,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507840348] [2024-11-16 18:13:03,615 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 18:13:03,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023817455] [2024-11-16 18:13:03,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023817455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:13:03,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:13:03,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-16 18:13:03,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487573113] [2024-11-16 18:13:03,616 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 18:13:03,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:13:03,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:13:03,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:13:03,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:13:03,617 INFO L87 Difference]: Start difference. First operand 728 states and 935 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-16 18:13:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:13:04,296 INFO L93 Difference]: Finished difference Result 1334 states and 1710 transitions. [2024-11-16 18:13:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:13:04,296 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 141 [2024-11-16 18:13:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:13:04,299 INFO L225 Difference]: With dead ends: 1334 [2024-11-16 18:13:04,299 INFO L226 Difference]: Without dead ends: 801 [2024-11-16 18:13:04,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2024-11-16 18:13:04,300 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 259 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:13:04,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 856 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:13:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-16 18:13:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 728. [2024-11-16 18:13:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 672 states have (on average 1.255952380952381) internal successors, (844), 674 states have internal predecessors, (844), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:13:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 934 transitions. [2024-11-16 18:13:04,390 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 934 transitions. Word has length 141 [2024-11-16 18:13:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:13:04,390 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 934 transitions. [2024-11-16 18:13:04,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-16 18:13:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 934 transitions. [2024-11-16 18:13:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 18:13:04,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:13:04,392 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:13:04,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 18:13:04,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:13:04,597 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:13:04,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:13:04,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2044530380, now seen corresponding path program 1 times [2024-11-16 18:13:04,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:13:04,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371834701] [2024-11-16 18:13:04,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:13:04,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:13:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:13:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:13:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:13:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:13:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:13:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:13:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:13:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:13:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:13:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:13:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:13:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:13:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:13:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:13:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:13:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:13:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:13:05,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:13:05,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371834701] [2024-11-16 18:13:05,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371834701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:13:05,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:13:05,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:13:05,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479973962] [2024-11-16 18:13:05,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:13:05,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:13:05,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:13:05,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:13:05,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:13:05,225 INFO L87 Difference]: Start difference. First operand 728 states and 934 transitions. Second operand has 8 states, 6 states have (on average 11.5) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:13:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:13:05,611 INFO L93 Difference]: Finished difference Result 1463 states and 1890 transitions. [2024-11-16 18:13:05,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:13:05,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.5) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 141 [2024-11-16 18:13:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:13:05,619 INFO L225 Difference]: With dead ends: 1463 [2024-11-16 18:13:05,619 INFO L226 Difference]: Without dead ends: 902 [2024-11-16 18:13:05,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:13:05,622 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 118 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:13:05,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 748 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:13:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-16 18:13:05,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 728. [2024-11-16 18:13:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 672 states have (on average 1.2529761904761905) internal successors, (842), 674 states have internal predecessors, (842), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 18:13:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 932 transitions. [2024-11-16 18:13:05,740 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 932 transitions. Word has length 141 [2024-11-16 18:13:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:13:05,741 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 932 transitions. [2024-11-16 18:13:05,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.5) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:13:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 932 transitions. [2024-11-16 18:13:05,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 18:13:05,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:13:05,742 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 18:13:05,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-16 18:13:05,743 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:13:05,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:13:05,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2075550187, now seen corresponding path program 1 times [2024-11-16 18:13:05,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:13:05,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845173834] [2024-11-16 18:13:05,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:13:05,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:13:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:13:05,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [700177026] [2024-11-16 18:13:05,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:13:05,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:13:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:13:05,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:13:05,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 18:13:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:13:06,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:13:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:13:06,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:13:06,777 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:13:06,778 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:13:06,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 18:13:06,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-16 18:13:06,984 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, 1, 1, 1, 1] [2024-11-16 18:13:07,092 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:13:07,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:13:07 BoogieIcfgContainer [2024-11-16 18:13:07,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:13:07,098 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:13:07,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:13:07,098 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:13:07,098 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:12:19" (3/4) ... [2024-11-16 18:13:07,101 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:13:07,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:13:07,102 INFO L158 Benchmark]: Toolchain (without parser) took 48546.01ms. Allocated memory was 165.7MB in the beginning and 1.1GB in the end (delta: 891.3MB). Free memory was 93.4MB in the beginning and 898.6MB in the end (delta: -805.2MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2024-11-16 18:13:07,102 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 165.7MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:13:07,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.15ms. Allocated memory is still 165.7MB. Free memory was 93.3MB in the beginning and 136.1MB in the end (delta: -42.8MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2024-11-16 18:13:07,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.41ms. Allocated memory is still 165.7MB. Free memory was 136.1MB in the beginning and 132.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:13:07,103 INFO L158 Benchmark]: Boogie Preprocessor took 76.57ms. Allocated memory is still 165.7MB. Free memory was 132.2MB in the beginning and 127.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:13:07,103 INFO L158 Benchmark]: IcfgBuilder took 758.25ms. Allocated memory is still 165.7MB. Free memory was 127.1MB in the beginning and 88.2MB in the end (delta: 38.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-16 18:13:07,103 INFO L158 Benchmark]: TraceAbstraction took 47230.79ms. Allocated memory was 165.7MB in the beginning and 1.1GB in the end (delta: 891.3MB). Free memory was 87.2MB in the beginning and 898.6MB in the end (delta: -811.4MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2024-11-16 18:13:07,103 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 1.1GB. Free memory is still 898.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:13:07,106 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.22ms. Allocated memory is still 165.7MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.15ms. Allocated memory is still 165.7MB. Free memory was 93.3MB in the beginning and 136.1MB in the end (delta: -42.8MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.41ms. Allocated memory is still 165.7MB. Free memory was 136.1MB in the beginning and 132.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.57ms. Allocated memory is still 165.7MB. Free memory was 132.2MB in the beginning and 127.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 758.25ms. Allocated memory is still 165.7MB. Free memory was 127.1MB in the beginning and 88.2MB in the end (delta: 38.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 47230.79ms. Allocated memory was 165.7MB in the beginning and 1.1GB in the end (delta: 891.3MB). Free memory was 87.2MB in the beginning and 898.6MB in the end (delta: -811.4MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 1.1GB. Free memory is still 898.6MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L25-L27] signed short int signed_short_int_Array_0[1] = { -25 }; [L25-L27] signed short int signed_short_int_Array_0[1] = { -25 }; [L28-L30] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L28-L30] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L28-L30] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L28-L30] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L28-L30] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 10, 4288034294 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 10, 4288034294 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 10, 4288034294 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 4, 5 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 4, 5 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 4, 5 }; [L37] unsigned char last_1_unsigned_char_Array_0_1__1_ = 0; [L38] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 10; VAL [float_Array_0={4:0}, isInitial=0, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L89] EXPR unsigned_char_Array_0[1][1] [L89] last_1_unsigned_char_Array_0_1__1_ = unsigned_char_Array_0[1][1] [L90] EXPR unsigned_long_int_Array_0[0] [L90] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L64] float_Array_0[0][0] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[0][0] [L65] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F [L65] EXPR float_Array_0[0][0] [L65] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] float_Array_0[1][0] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[1][0] [L67] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L67] EXPR float_Array_0[1][0] [L67] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not(float_Array_0[1][0] != 0.0F) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not(float_Array_0[1][0] != 0.0F) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] float_Array_0[0][1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] float_Array_0[1][1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR float_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(float_Array_0[1][1] != 0.0F) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(float_Array_0[1][1] != 0.0F) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L75] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L79] EXPR unsigned_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR unsigned_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0][1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] EXPR unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0][1] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0][1] <= 254) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L85] EXPR unsigned_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR unsigned_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L101] RET updateVariables() [L102] CALL step() [L42] EXPR signed_short_int_Array_0[0] [L42] unsigned long int stepLocal_2 = last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]; [L43] COND TRUE stepLocal_2 != (last_1_unsigned_char_Array_0_1__1_ - 64) [L44] EXPR unsigned_char_Array_0[1][0] [L44] EXPR unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]) [L44] EXPR unsigned_char_Array_0[1][0] [L44] EXPR ((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] unsigned_char_Array_0[0][0] = ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))) [L48] EXPR float_Array_0[0][0] [L48] EXPR float_Array_0[0][1] [L48] EXPR float_Array_0[1][1] [L48] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] EXPR ((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]) [L48] EXPR float_Array_0[1][1] [L48] EXPR ((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] COND TRUE (- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0])))) [L49] EXPR unsigned_char_Array_0[1][0] [L49] EXPR unsigned_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L49] EXPR ((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0]) [L49] EXPR unsigned_char_Array_0[0][0] [L49] EXPR ((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L49] unsigned_long_int_Array_0[0] = (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))) [L53] EXPR unsigned_char_Array_0[0][1] [L53] unsigned_char_Array_0[1][1] = unsigned_char_Array_0[0][1] [L54] EXPR unsigned_char_Array_0[1][1] [L54] unsigned_short_int_Array_0[0] = unsigned_char_Array_0[1][1] [L55] EXPR signed_short_int_Array_0[0] [L55] signed long int stepLocal_1 = - signed_short_int_Array_0[0]; [L56] EXPR unsigned_short_int_Array_0[0] [L56] EXPR signed_short_int_Array_0[0] [L56] signed long int stepLocal_0 = unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]; [L57] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !(stepLocal_0 >= unsigned_short_int_Array_0[0]) [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR unsigned_short_int_Array_0[0] [L93] EXPR signed_short_int_Array_0[0] [L93] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1 [L93] EXPR ((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1 VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR (((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR (((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1])) [L93] EXPR unsigned_short_int_Array_0[0] [L93] EXPR unsigned_char_Array_0[1][1] [L93] EXPR (((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))))) [L93] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))) [L93] EXPR unsigned_char_Array_0[0][0] [L93] EXPR unsigned_char_Array_0[1][0] [L93] EXPR unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]) [L93] EXPR unsigned_char_Array_0[1][0] [L93] EXPR ((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR (((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))))) && (((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0])))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR (((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))))) && (((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0])))) [L93] EXPR float_Array_0[0][0] [L93] EXPR float_Array_0[0][1] [L93] EXPR float_Array_0[1][1] [L93] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]) [L93] EXPR float_Array_0[1][1] [L93] EXPR ((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0]))) [L93] EXPR unsigned_long_int_Array_0[0] [L93] EXPR unsigned_long_int_Array_0[1] [L93] EXPR unsigned_char_Array_0[1][0] [L93] EXPR ((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0]))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR (((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))))) && (((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0])))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))))) && (((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0]))))) && (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))))) && (((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0]))))) && (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93-L94] return ((((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))))) && (((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0]))))) && (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][1])) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.1s, OverallIterations: 33, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5714 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5686 mSDsluCounter, 33080 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27048 mSDsCounter, 509 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12453 IncrementalHoareTripleChecker+Invalid, 12962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 509 mSolverCounterUnsat, 6032 mSDtfsCounter, 12453 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1591 GetRequests, 1266 SyntacticMatches, 2 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=828occurred in iteration=22, InterpolantAutomatonStates: 317, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 4480 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 23.1s InterpolantComputationTime, 4806 NumberOfCodeBlocks, 4806 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4351 ConstructedInterpolants, 0 QuantifiedInterpolants, 19425 SizeOfPredicates, 7 NumberOfNonLiveVariables, 505 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 32 InterpolantComputations, 31 PerfectInterpolantSequences, 13422/13440 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 18:13:07,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0c11a71501857fba3402e4bb377289983d3b24a383b44d5d668b185a2e73be4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:13:09,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:13:09,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:13:09,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:13:09,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:13:09,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:13:09,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:13:09,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:13:09,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:13:09,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:13:09,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:13:09,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:13:09,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:13:09,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:13:09,543 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:13:09,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:13:09,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:13:09,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:13:09,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:13:09,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:13:09,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:13:09,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:13:09,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:13:09,547 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:13:09,547 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:13:09,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:13:09,549 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:13:09,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:13:09,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:13:09,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:13:09,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:13:09,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:13:09,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:13:09,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:13:09,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:13:09,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:13:09,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:13:09,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:13:09,551 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:13:09,551 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:13:09,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:13:09,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:13:09,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:13:09,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:13:09,554 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0c11a71501857fba3402e4bb377289983d3b24a383b44d5d668b185a2e73be4 [2024-11-16 18:13:09,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:13:09,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:13:09,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:13:09,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:13:09,915 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:13:09,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i [2024-11-16 18:13:11,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:13:11,705 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:13:11,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i [2024-11-16 18:13:11,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73ddfdd1/9d61c9cb11a5473098cd166886031058/FLAG6dd3cf932 [2024-11-16 18:13:11,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73ddfdd1/9d61c9cb11a5473098cd166886031058 [2024-11-16 18:13:11,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:13:11,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:13:11,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:13:11,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:13:11,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:13:11,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:13:11" (1/1) ... [2024-11-16 18:13:11,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79418bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:11, skipping insertion in model container [2024-11-16 18:13:11,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:13:11" (1/1) ... [2024-11-16 18:13:11,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:13:11,960 WARN L250 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-4.i[915,928] [2024-11-16 18:13:12,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:13:12,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:13:12,108 WARN L250 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-4.i[915,928] [2024-11-16 18:13:12,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:13:12,200 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:13:12,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12 WrapperNode [2024-11-16 18:13:12,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:13:12,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:13:12,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:13:12,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:13:12,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12" (1/1) ... [2024-11-16 18:13:12,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12" (1/1) ... [2024-11-16 18:13:12,284 INFO L138 Inliner]: procedures = 36, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 494 [2024-11-16 18:13:12,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:13:12,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:13:12,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:13:12,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:13:12,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12" (1/1) ... [2024-11-16 18:13:12,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12" (1/1) ... [2024-11-16 18:13:12,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12" (1/1) ... [2024-11-16 18:13:12,353 INFO L175 MemorySlicer]: Split 130 memory accesses to 6 slices as follows [2, 38, 11, 55, 12, 12]. 42 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 4, 1, 4, 2, 2]. The 15 writes are split as follows [0, 4, 1, 5, 3, 2]. [2024-11-16 18:13:12,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12" (1/1) ... [2024-11-16 18:13:12,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12" (1/1) ... [2024-11-16 18:13:12,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12" (1/1) ... [2024-11-16 18:13:12,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12" (1/1) ... [2024-11-16 18:13:12,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12" (1/1) ... [2024-11-16 18:13:12,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12" (1/1) ... [2024-11-16 18:13:12,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:13:12,400 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:13:12,400 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:13:12,400 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:13:12,404 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:12" (1/1) ... [2024-11-16 18:13:12,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:13:12,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:13:12,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:13:12,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:13:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:13:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:13:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:13:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-16 18:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-16 18:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-16 18:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-16 18:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-16 18:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-16 18:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-16 18:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-16 18:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-16 18:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-16 18:13:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:13:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:13:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 18:13:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-16 18:13:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-16 18:13:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-16 18:13:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-16 18:13:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-16 18:13:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-16 18:13:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-16 18:13:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-16 18:13:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-16 18:13:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 18:13:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 18:13:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-16 18:13:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-16 18:13:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-16 18:13:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-16 18:13:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 18:13:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 18:13:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-16 18:13:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-16 18:13:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-16 18:13:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-16 18:13:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-16 18:13:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-16 18:13:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-16 18:13:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-16 18:13:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-16 18:13:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-16 18:13:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 18:13:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 18:13:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-16 18:13:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-16 18:13:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-16 18:13:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-16 18:13:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-16 18:13:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-16 18:13:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-16 18:13:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-16 18:13:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-16 18:13:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-16 18:13:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:13:12,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:13:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:13:12,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:13:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:13:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:13:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-16 18:13:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-16 18:13:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-16 18:13:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-16 18:13:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-16 18:13:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-16 18:13:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-16 18:13:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-16 18:13:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-16 18:13:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-16 18:13:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 18:13:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 18:13:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-16 18:13:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-16 18:13:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-16 18:13:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-16 18:13:12,682 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:13:12,684 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation