./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.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 944d6be29b18a7b057c10d85533dd285a58675394c7ffcf3e8926ec3db51ce25 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:15:11,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:15:11,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:15:11,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:15:11,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:15:11,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:15:11,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:15:11,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:15:11,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:15:11,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:15:11,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:15:11,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:15:11,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:15:11,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:15:11,528 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:15:11,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:15:11,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:15:11,529 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:15:11,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:15:11,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:15:11,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:15:11,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:15:11,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:15:11,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:15:11,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:15:11,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:15:11,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:15:11,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:15:11,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:15:11,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:15:11,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:15:11,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:15:11,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:15:11,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:15:11,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:15:11,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:15:11,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:15:11,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:15:11,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:15:11,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:15:11,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:15:11,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:15:11,537 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 -> 944d6be29b18a7b057c10d85533dd285a58675394c7ffcf3e8926ec3db51ce25 [2024-10-13 06:15:11,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:15:11,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:15:11,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:15:11,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:15:11,854 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:15:11,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i [2024-10-13 06:15:13,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:15:13,543 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:15:13,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i [2024-10-13 06:15:13,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fccc7665/431d0020214f4e7cbe6ec27b74744115/FLAG34bb57d8a [2024-10-13 06:15:13,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fccc7665/431d0020214f4e7cbe6ec27b74744115 [2024-10-13 06:15:13,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:15:13,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:15:13,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:15:13,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:15:13,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:15:13,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:15:13" (1/1) ... [2024-10-13 06:15:13,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76628d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:13, skipping insertion in model container [2024-10-13 06:15:13,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:15:13" (1/1) ... [2024-10-13 06:15:13,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:15:14,190 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i[916,929] [2024-10-13 06:15:14,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:15:14,300 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:15:14,322 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i[916,929] [2024-10-13 06:15:14,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:15:14,440 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:15:14,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14 WrapperNode [2024-10-13 06:15:14,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:15:14,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:15:14,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:15:14,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:15:14,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (1/1) ... [2024-10-13 06:15:14,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (1/1) ... [2024-10-13 06:15:14,527 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 527 [2024-10-13 06:15:14,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:15:14,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:15:14,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:15:14,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:15:14,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (1/1) ... [2024-10-13 06:15:14,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (1/1) ... [2024-10-13 06:15:14,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (1/1) ... [2024-10-13 06:15:14,610 INFO L175 MemorySlicer]: Split 127 memory accesses to 13 slices as follows [2, 11, 10, 6, 14, 9, 14, 10, 5, 8, 14, 14, 10]. 11 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1]. [2024-10-13 06:15:14,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (1/1) ... [2024-10-13 06:15:14,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (1/1) ... [2024-10-13 06:15:14,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (1/1) ... [2024-10-13 06:15:14,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (1/1) ... [2024-10-13 06:15:14,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (1/1) ... [2024-10-13 06:15:14,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (1/1) ... [2024-10-13 06:15:14,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:15:14,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:15:14,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:15:14,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:15:14,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (1/1) ... [2024-10-13 06:15:14,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:15:14,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:15:14,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:15:14,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:15:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:15:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:15:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:15:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 06:15:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 06:15:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 06:15:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-13 06:15:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-13 06:15:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-13 06:15:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-13 06:15:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-13 06:15:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-13 06:15:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-13 06:15:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-13 06:15:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:15:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:15:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 06:15:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 06:15:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 06:15:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 06:15:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 06:15:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 06:15:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 06:15:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 06:15:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-13 06:15:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-13 06:15:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-13 06:15:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:15:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:15:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 06:15:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 06:15:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 06:15:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-13 06:15:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-13 06:15:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-13 06:15:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-13 06:15:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-13 06:15:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-13 06:15:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-13 06:15:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-13 06:15:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:15:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:15:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 06:15:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 06:15:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 06:15:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 06:15:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 06:15:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 06:15:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 06:15:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 06:15:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-13 06:15:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-13 06:15:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-13 06:15:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:15:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:15:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 06:15:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 06:15:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 06:15:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-13 06:15:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-13 06:15:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-13 06:15:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-13 06:15:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-13 06:15:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-13 06:15:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-13 06:15:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-13 06:15:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:15:14,772 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:15:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:15:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:15:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 06:15:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 06:15:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 06:15:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 06:15:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 06:15:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 06:15:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 06:15:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 06:15:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-13 06:15:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-13 06:15:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-13 06:15:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:15:14,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:15:14,943 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:15:14,945 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:15:15,379 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-13 06:15:15,381 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:15:15,430 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:15:15,431 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:15:15,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:15:15 BoogieIcfgContainer [2024-10-13 06:15:15,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:15:15,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:15:15,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:15:15,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:15:15,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:15:13" (1/3) ... [2024-10-13 06:15:15,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1656925f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:15:15, skipping insertion in model container [2024-10-13 06:15:15,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:14" (2/3) ... [2024-10-13 06:15:15,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1656925f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:15:15, skipping insertion in model container [2024-10-13 06:15:15,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:15:15" (3/3) ... [2024-10-13 06:15:15,440 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-15.i [2024-10-13 06:15:15,454 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:15:15,455 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:15:15,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:15:15,533 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;@221d90d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:15:15,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:15:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:15:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:15:15,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:15,555 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:15,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:15,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 525160248, now seen corresponding path program 1 times [2024-10-13 06:15:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:15,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508230672] [2024-10-13 06:15:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:15,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:15,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:15,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:15,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:15,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:15,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:15,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:15,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:15,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:15,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:15,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:15,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:16,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508230672] [2024-10-13 06:15:16,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508230672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:16,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:16,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:15:16,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335067742] [2024-10-13 06:15:16,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:16,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:15:16,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:16,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:15:16,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:15:16,084 INFO L87 Difference]: Start difference. First operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:15:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:16,175 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2024-10-13 06:15:16,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:15:16,177 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-13 06:15:16,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:16,184 INFO L225 Difference]: With dead ends: 209 [2024-10-13 06:15:16,184 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 06:15:16,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:15:16,193 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:16,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 06:15:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-13 06:15:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:15:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-10-13 06:15:16,236 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2024-10-13 06:15:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:16,236 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-10-13 06:15:16,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:15:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-10-13 06:15:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:15:16,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:16,239 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:16,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:15:16,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:16,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:16,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2106096342, now seen corresponding path program 1 times [2024-10-13 06:15:16,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:16,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717872057] [2024-10-13 06:15:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:16,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:16,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:16,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717872057] [2024-10-13 06:15:16,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717872057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:16,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:16,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:15:16,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773131125] [2024-10-13 06:15:16,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:16,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:15:16,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:16,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:15:16,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:15:16,493 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:16,534 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2024-10-13 06:15:16,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:15:16,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-13 06:15:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:16,537 INFO L225 Difference]: With dead ends: 208 [2024-10-13 06:15:16,537 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 06:15:16,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:15:16,538 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:16,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:16,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 06:15:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 06:15:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:15:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-10-13 06:15:16,548 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 110 [2024-10-13 06:15:16,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:16,550 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-10-13 06:15:16,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-10-13 06:15:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:15:16,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:16,552 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:16,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:15:16,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:16,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash 194726248, now seen corresponding path program 1 times [2024-10-13 06:15:16,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:16,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799585560] [2024-10-13 06:15:16,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:16,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:16,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:16,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799585560] [2024-10-13 06:15:16,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799585560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:16,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:16,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:15:16,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418407231] [2024-10-13 06:15:16,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:16,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:15:16,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:16,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:15:16,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:15:16,717 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:16,750 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2024-10-13 06:15:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:15:16,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-13 06:15:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:16,751 INFO L225 Difference]: With dead ends: 210 [2024-10-13 06:15:16,751 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 06:15:16,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:15:16,753 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:16,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:16,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 06:15:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-13 06:15:16,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:15:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-10-13 06:15:16,761 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 110 [2024-10-13 06:15:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:16,761 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-10-13 06:15:16,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-10-13 06:15:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:15:16,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:16,763 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:16,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:15:16,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:16,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:16,764 INFO L85 PathProgramCache]: Analyzing trace with hash 895790826, now seen corresponding path program 1 times [2024-10-13 06:15:16,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:16,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338549816] [2024-10-13 06:15:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:16,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:17,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:17,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338549816] [2024-10-13 06:15:17,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338549816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:17,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:17,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:15:17,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981868057] [2024-10-13 06:15:17,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:17,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:15:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:15:17,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:15:17,249 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:17,354 INFO L93 Difference]: Finished difference Result 267 states and 384 transitions. [2024-10-13 06:15:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:17,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-13 06:15:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:17,357 INFO L225 Difference]: With dead ends: 267 [2024-10-13 06:15:17,359 INFO L226 Difference]: Without dead ends: 162 [2024-10-13 06:15:17,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:15:17,361 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 68 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:17,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 658 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-13 06:15:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2024-10-13 06:15:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 140 states have (on average 1.4) internal successors, (196), 141 states have internal predecessors, (196), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:15:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 228 transitions. [2024-10-13 06:15:17,376 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 228 transitions. Word has length 110 [2024-10-13 06:15:17,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:17,376 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 228 transitions. [2024-10-13 06:15:17,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 228 transitions. [2024-10-13 06:15:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 06:15:17,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:17,378 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:17,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:15:17,378 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:17,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:17,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1920041920, now seen corresponding path program 1 times [2024-10-13 06:15:17,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:17,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361056745] [2024-10-13 06:15:17,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:17,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:17,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:17,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361056745] [2024-10-13 06:15:17,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361056745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:17,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:17,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:15:17,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759441714] [2024-10-13 06:15:17,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:17,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:15:17,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:15:17,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:15:17,891 INFO L87 Difference]: Start difference. First operand 159 states and 228 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:18,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:18,084 INFO L93 Difference]: Finished difference Result 480 states and 690 transitions. [2024-10-13 06:15:18,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:15:18,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-10-13 06:15:18,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:18,089 INFO L225 Difference]: With dead ends: 480 [2024-10-13 06:15:18,091 INFO L226 Difference]: Without dead ends: 322 [2024-10-13 06:15:18,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:15:18,096 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 254 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:18,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 654 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:18,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-13 06:15:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 309. [2024-10-13 06:15:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 272 states have (on average 1.400735294117647) internal successors, (381), 274 states have internal predecessors, (381), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:15:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 445 transitions. [2024-10-13 06:15:18,141 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 445 transitions. Word has length 111 [2024-10-13 06:15:18,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:18,144 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 445 transitions. [2024-10-13 06:15:18,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 445 transitions. [2024-10-13 06:15:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 06:15:18,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:18,146 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:18,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:15:18,146 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:18,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1321845930, now seen corresponding path program 1 times [2024-10-13 06:15:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683169930] [2024-10-13 06:15:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:18,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683169930] [2024-10-13 06:15:18,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683169930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:18,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:18,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:15:18,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619583155] [2024-10-13 06:15:18,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:18,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:15:18,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:18,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:15:18,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:18,553 INFO L87 Difference]: Start difference. First operand 309 states and 445 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:18,703 INFO L93 Difference]: Finished difference Result 621 states and 893 transitions. [2024-10-13 06:15:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:18,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-10-13 06:15:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:18,706 INFO L225 Difference]: With dead ends: 621 [2024-10-13 06:15:18,706 INFO L226 Difference]: Without dead ends: 313 [2024-10-13 06:15:18,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:15:18,709 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 221 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:18,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 563 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-13 06:15:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 308. [2024-10-13 06:15:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 271 states have (on average 1.3985239852398523) internal successors, (379), 273 states have internal predecessors, (379), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:15:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 443 transitions. [2024-10-13 06:15:18,736 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 443 transitions. Word has length 112 [2024-10-13 06:15:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:18,737 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 443 transitions. [2024-10-13 06:15:18,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 443 transitions. [2024-10-13 06:15:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 06:15:18,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:18,739 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:18,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:15:18,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:18,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1507718356, now seen corresponding path program 1 times [2024-10-13 06:15:18,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:18,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974083904] [2024-10-13 06:15:18,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:18,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:19,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:19,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974083904] [2024-10-13 06:15:19,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974083904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:19,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:19,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:15:19,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881990558] [2024-10-13 06:15:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:19,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:15:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:15:19,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:19,123 INFO L87 Difference]: Start difference. First operand 308 states and 443 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:19,233 INFO L93 Difference]: Finished difference Result 825 states and 1191 transitions. [2024-10-13 06:15:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:15:19,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-13 06:15:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:19,236 INFO L225 Difference]: With dead ends: 825 [2024-10-13 06:15:19,237 INFO L226 Difference]: Without dead ends: 518 [2024-10-13 06:15:19,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:15:19,242 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 144 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:19,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1088 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-10-13 06:15:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 516. [2024-10-13 06:15:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 455 states have internal predecessors, (634), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 06:15:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 746 transitions. [2024-10-13 06:15:19,275 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 746 transitions. Word has length 113 [2024-10-13 06:15:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:19,276 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 746 transitions. [2024-10-13 06:15:19,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 746 transitions. [2024-10-13 06:15:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 06:15:19,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:19,277 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:19,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:15:19,277 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:19,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash 839754427, now seen corresponding path program 1 times [2024-10-13 06:15:19,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:19,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229118692] [2024-10-13 06:15:19,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:19,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:19,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:19,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229118692] [2024-10-13 06:15:19,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229118692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:19,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:19,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:15:19,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271354099] [2024-10-13 06:15:19,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:19,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:15:19,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:19,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:15:19,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:15:19,576 INFO L87 Difference]: Start difference. First operand 516 states and 746 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:19,652 INFO L93 Difference]: Finished difference Result 1310 states and 1891 transitions. [2024-10-13 06:15:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:15:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-13 06:15:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:19,657 INFO L225 Difference]: With dead ends: 1310 [2024-10-13 06:15:19,657 INFO L226 Difference]: Without dead ends: 795 [2024-10-13 06:15:19,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:19,660 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 59 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:19,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 657 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-10-13 06:15:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 598. [2024-10-13 06:15:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 535 states have (on average 1.4093457943925234) internal successors, (754), 537 states have internal predecessors, (754), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 06:15:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 866 transitions. [2024-10-13 06:15:19,698 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 866 transitions. Word has length 113 [2024-10-13 06:15:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:19,699 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 866 transitions. [2024-10-13 06:15:19,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 866 transitions. [2024-10-13 06:15:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 06:15:19,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:19,700 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:19,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:15:19,700 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:19,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:19,701 INFO L85 PathProgramCache]: Analyzing trace with hash -393530266, now seen corresponding path program 1 times [2024-10-13 06:15:19,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:19,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601533438] [2024-10-13 06:15:19,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:19,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:19,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:19,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601533438] [2024-10-13 06:15:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601533438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:19,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:19,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:15:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145147682] [2024-10-13 06:15:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:19,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:15:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:19,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:15:19,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:15:19,948 INFO L87 Difference]: Start difference. First operand 598 states and 866 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:20,012 INFO L93 Difference]: Finished difference Result 1387 states and 2000 transitions. [2024-10-13 06:15:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-13 06:15:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:20,017 INFO L225 Difference]: With dead ends: 1387 [2024-10-13 06:15:20,017 INFO L226 Difference]: Without dead ends: 790 [2024-10-13 06:15:20,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:20,018 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 68 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:20,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 639 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-10-13 06:15:20,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 596. [2024-10-13 06:15:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 533 states have (on average 1.403377110694184) internal successors, (748), 535 states have internal predecessors, (748), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 06:15:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 860 transitions. [2024-10-13 06:15:20,045 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 860 transitions. Word has length 113 [2024-10-13 06:15:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:20,046 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 860 transitions. [2024-10-13 06:15:20,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 860 transitions. [2024-10-13 06:15:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 06:15:20,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:20,047 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:20,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:15:20,048 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:20,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:20,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2082474008, now seen corresponding path program 1 times [2024-10-13 06:15:20,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:20,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138525387] [2024-10-13 06:15:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:20,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:20,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138525387] [2024-10-13 06:15:20,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138525387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:20,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:20,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:15:20,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731365415] [2024-10-13 06:15:20,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:20,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:15:20,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:20,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:15:20,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:15:20,365 INFO L87 Difference]: Start difference. First operand 596 states and 860 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:20,490 INFO L93 Difference]: Finished difference Result 1205 states and 1738 transitions. [2024-10-13 06:15:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:15:20,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-13 06:15:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:20,495 INFO L225 Difference]: With dead ends: 1205 [2024-10-13 06:15:20,495 INFO L226 Difference]: Without dead ends: 899 [2024-10-13 06:15:20,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:15:20,497 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 173 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:20,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 727 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2024-10-13 06:15:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 865. [2024-10-13 06:15:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 771 states have (on average 1.398184176394293) internal successors, (1078), 774 states have internal predecessors, (1078), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:15:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1246 transitions. [2024-10-13 06:15:20,533 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1246 transitions. Word has length 113 [2024-10-13 06:15:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:20,534 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1246 transitions. [2024-10-13 06:15:20,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1246 transitions. [2024-10-13 06:15:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:15:20,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:20,539 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:20,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:15:20,539 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:20,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash -782680435, now seen corresponding path program 1 times [2024-10-13 06:15:20,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:20,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799586897] [2024-10-13 06:15:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:20,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799586897] [2024-10-13 06:15:20,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799586897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:20,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:20,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:15:20,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499474893] [2024-10-13 06:15:20,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:20,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:15:20,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:15:20,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:15:20,887 INFO L87 Difference]: Start difference. First operand 865 states and 1246 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:20,957 INFO L93 Difference]: Finished difference Result 1817 states and 2611 transitions. [2024-10-13 06:15:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:20,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:15:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:20,961 INFO L225 Difference]: With dead ends: 1817 [2024-10-13 06:15:20,961 INFO L226 Difference]: Without dead ends: 953 [2024-10-13 06:15:20,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:20,964 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 69 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:20,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 656 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2024-10-13 06:15:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 807. [2024-10-13 06:15:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 713 states have (on average 1.3955119214586256) internal successors, (995), 716 states have internal predecessors, (995), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:15:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1163 transitions. [2024-10-13 06:15:20,997 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1163 transitions. Word has length 114 [2024-10-13 06:15:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:20,997 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1163 transitions. [2024-10-13 06:15:20,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1163 transitions. [2024-10-13 06:15:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:15:20,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:20,999 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:20,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:15:20,999 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:21,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:21,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1667505093, now seen corresponding path program 1 times [2024-10-13 06:15:21,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:21,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131582394] [2024-10-13 06:15:21,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:21,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:21,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131582394] [2024-10-13 06:15:21,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131582394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:21,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:21,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:15:21,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000560979] [2024-10-13 06:15:21,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:21,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:15:21,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:21,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:15:21,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:15:21,264 INFO L87 Difference]: Start difference. First operand 807 states and 1163 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:21,338 INFO L93 Difference]: Finished difference Result 1370 states and 1969 transitions. [2024-10-13 06:15:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:21,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:15:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:21,342 INFO L225 Difference]: With dead ends: 1370 [2024-10-13 06:15:21,342 INFO L226 Difference]: Without dead ends: 811 [2024-10-13 06:15:21,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:21,344 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 64 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:21,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 724 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-10-13 06:15:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 777. [2024-10-13 06:15:21,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 683 states have (on average 1.3879941434846266) internal successors, (948), 686 states have internal predecessors, (948), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:15:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1116 transitions. [2024-10-13 06:15:21,378 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1116 transitions. Word has length 114 [2024-10-13 06:15:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:21,378 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1116 transitions. [2024-10-13 06:15:21,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1116 transitions. [2024-10-13 06:15:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:15:21,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:21,380 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:21,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:15:21,380 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:21,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash -140945536, now seen corresponding path program 1 times [2024-10-13 06:15:21,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:21,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100373699] [2024-10-13 06:15:21,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:21,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:21,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:21,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100373699] [2024-10-13 06:15:21,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100373699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:21,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:21,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:15:21,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002490780] [2024-10-13 06:15:21,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:21,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:15:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:15:21,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:15:21,564 INFO L87 Difference]: Start difference. First operand 777 states and 1116 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:21,625 INFO L93 Difference]: Finished difference Result 1586 states and 2276 transitions. [2024-10-13 06:15:21,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:21,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:15:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:21,630 INFO L225 Difference]: With dead ends: 1586 [2024-10-13 06:15:21,630 INFO L226 Difference]: Without dead ends: 810 [2024-10-13 06:15:21,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:21,631 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 60 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:21,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 562 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2024-10-13 06:15:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 777. [2024-10-13 06:15:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 683 states have (on average 1.3777452415812592) internal successors, (941), 686 states have internal predecessors, (941), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:15:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1109 transitions. [2024-10-13 06:15:21,660 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1109 transitions. Word has length 114 [2024-10-13 06:15:21,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:21,660 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1109 transitions. [2024-10-13 06:15:21,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:21,661 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1109 transitions. [2024-10-13 06:15:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:15:21,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:21,662 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:21,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:15:21,662 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:21,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash -727751550, now seen corresponding path program 1 times [2024-10-13 06:15:21,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:21,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986359245] [2024-10-13 06:15:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:22,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:22,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986359245] [2024-10-13 06:15:22,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986359245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:22,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:22,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:15:22,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820591114] [2024-10-13 06:15:22,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:22,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:15:22,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:22,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:15:22,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:15:22,045 INFO L87 Difference]: Start difference. First operand 777 states and 1109 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:22,424 INFO L93 Difference]: Finished difference Result 1687 states and 2400 transitions. [2024-10-13 06:15:22,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:15:22,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:15:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:22,428 INFO L225 Difference]: With dead ends: 1687 [2024-10-13 06:15:22,428 INFO L226 Difference]: Without dead ends: 911 [2024-10-13 06:15:22,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:15:22,430 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 402 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:22,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1408 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2024-10-13 06:15:22,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 787. [2024-10-13 06:15:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 693 states have (on average 1.3751803751803753) internal successors, (953), 696 states have internal predecessors, (953), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:15:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1121 transitions. [2024-10-13 06:15:22,466 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1121 transitions. Word has length 114 [2024-10-13 06:15:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:22,467 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1121 transitions. [2024-10-13 06:15:22,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1121 transitions. [2024-10-13 06:15:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:15:22,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:22,469 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:22,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:15:22,469 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:22,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:22,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1831430926, now seen corresponding path program 1 times [2024-10-13 06:15:22,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:22,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756170509] [2024-10-13 06:15:22,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:22,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:22,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:22,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756170509] [2024-10-13 06:15:22,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756170509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:22,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:22,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:15:22,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933284235] [2024-10-13 06:15:22,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:22,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:15:22,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:22,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:15:22,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:15:22,703 INFO L87 Difference]: Start difference. First operand 787 states and 1121 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:22,806 INFO L93 Difference]: Finished difference Result 1439 states and 2046 transitions. [2024-10-13 06:15:22,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:22,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:15:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:22,810 INFO L225 Difference]: With dead ends: 1439 [2024-10-13 06:15:22,810 INFO L226 Difference]: Without dead ends: 881 [2024-10-13 06:15:22,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:22,812 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 243 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:22,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 667 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-10-13 06:15:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 871. [2024-10-13 06:15:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 763 states have (on average 1.3695937090432504) internal successors, (1045), 766 states have internal predecessors, (1045), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 06:15:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1237 transitions. [2024-10-13 06:15:22,850 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1237 transitions. Word has length 114 [2024-10-13 06:15:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:22,851 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1237 transitions. [2024-10-13 06:15:22,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1237 transitions. [2024-10-13 06:15:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:15:22,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:22,852 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:22,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:15:22,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:22,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:22,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1195476484, now seen corresponding path program 1 times [2024-10-13 06:15:22,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:22,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282907640] [2024-10-13 06:15:22,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:22,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282907640] [2024-10-13 06:15:23,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282907640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:23,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:23,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:15:23,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871174402] [2024-10-13 06:15:23,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:23,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:15:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:23,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:15:23,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:15:23,337 INFO L87 Difference]: Start difference. First operand 871 states and 1237 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:23,708 INFO L93 Difference]: Finished difference Result 1909 states and 2709 transitions. [2024-10-13 06:15:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:15:23,709 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:15:23,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:23,714 INFO L225 Difference]: With dead ends: 1909 [2024-10-13 06:15:23,714 INFO L226 Difference]: Without dead ends: 1039 [2024-10-13 06:15:23,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:15:23,717 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 320 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:23,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1121 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-10-13 06:15:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 881. [2024-10-13 06:15:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 773 states have (on average 1.3661060802069858) internal successors, (1056), 776 states have internal predecessors, (1056), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 06:15:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1248 transitions. [2024-10-13 06:15:23,760 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1248 transitions. Word has length 114 [2024-10-13 06:15:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:23,760 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1248 transitions. [2024-10-13 06:15:23,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1248 transitions. [2024-10-13 06:15:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 06:15:23,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:23,762 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:23,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:15:23,762 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash -877264650, now seen corresponding path program 1 times [2024-10-13 06:15:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933869770] [2024-10-13 06:15:23,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:24,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:24,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933869770] [2024-10-13 06:15:24,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933869770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:24,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:24,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:15:24,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877812975] [2024-10-13 06:15:24,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:24,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:15:24,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:24,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:15:24,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:15:24,195 INFO L87 Difference]: Start difference. First operand 881 states and 1248 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:24,545 INFO L93 Difference]: Finished difference Result 1914 states and 2710 transitions. [2024-10-13 06:15:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:15:24,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-10-13 06:15:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:24,550 INFO L225 Difference]: With dead ends: 1914 [2024-10-13 06:15:24,550 INFO L226 Difference]: Without dead ends: 1034 [2024-10-13 06:15:24,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:15:24,553 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 445 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:24,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1045 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-13 06:15:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 881. [2024-10-13 06:15:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 773 states have (on average 1.3648124191461837) internal successors, (1055), 776 states have internal predecessors, (1055), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 06:15:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1247 transitions. [2024-10-13 06:15:24,594 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1247 transitions. Word has length 115 [2024-10-13 06:15:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:24,594 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1247 transitions. [2024-10-13 06:15:24,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1247 transitions. [2024-10-13 06:15:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:15:24,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:24,596 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:24,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:15:24,597 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:24,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2046313010, now seen corresponding path program 1 times [2024-10-13 06:15:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:24,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444586984] [2024-10-13 06:15:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:25,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444586984] [2024-10-13 06:15:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444586984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:25,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:15:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119008839] [2024-10-13 06:15:25,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:25,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:15:25,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:25,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:15:25,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:15:25,416 INFO L87 Difference]: Start difference. First operand 881 states and 1247 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:15:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:26,430 INFO L93 Difference]: Finished difference Result 2266 states and 3218 transitions. [2024-10-13 06:15:26,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:15:26,431 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-10-13 06:15:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:26,437 INFO L225 Difference]: With dead ends: 2266 [2024-10-13 06:15:26,438 INFO L226 Difference]: Without dead ends: 1653 [2024-10-13 06:15:26,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-10-13 06:15:26,440 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 498 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:26,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 2255 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:15:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-10-13 06:15:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 965. [2024-10-13 06:15:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 857 states have (on average 1.3617269544924153) internal successors, (1167), 860 states have internal predecessors, (1167), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 06:15:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1359 transitions. [2024-10-13 06:15:26,518 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1359 transitions. Word has length 116 [2024-10-13 06:15:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:26,518 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1359 transitions. [2024-10-13 06:15:26,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:15:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1359 transitions. [2024-10-13 06:15:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:15:26,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:26,520 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:26,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:15:26,520 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:26,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:26,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2108105676, now seen corresponding path program 1 times [2024-10-13 06:15:26,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:26,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891459948] [2024-10-13 06:15:26,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:26,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:27,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:27,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891459948] [2024-10-13 06:15:27,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891459948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:27,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:27,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:15:27,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561854902] [2024-10-13 06:15:27,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:27,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:15:27,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:27,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:15:27,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:15:27,476 INFO L87 Difference]: Start difference. First operand 965 states and 1359 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:15:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:28,713 INFO L93 Difference]: Finished difference Result 2430 states and 3434 transitions. [2024-10-13 06:15:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:15:28,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-10-13 06:15:28,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:28,721 INFO L225 Difference]: With dead ends: 2430 [2024-10-13 06:15:28,721 INFO L226 Difference]: Without dead ends: 1733 [2024-10-13 06:15:28,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:15:28,723 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 471 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:28,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 2218 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:15:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2024-10-13 06:15:28,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1429. [2024-10-13 06:15:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1259 states have (on average 1.363780778395552) internal successors, (1717), 1264 states have internal predecessors, (1717), 152 states have call successors, (152), 17 states have call predecessors, (152), 17 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2024-10-13 06:15:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2021 transitions. [2024-10-13 06:15:28,831 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2021 transitions. Word has length 116 [2024-10-13 06:15:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:28,831 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 2021 transitions. [2024-10-13 06:15:28,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:15:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2021 transitions. [2024-10-13 06:15:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:15:28,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:28,833 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:28,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 06:15:28,833 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:28,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1083263989, now seen corresponding path program 1 times [2024-10-13 06:15:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:28,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355236071] [2024-10-13 06:15:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:28,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:28,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355236071] [2024-10-13 06:15:28,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355236071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:28,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:28,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:15:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737523613] [2024-10-13 06:15:28,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:28,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:15:28,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:28,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:15:28,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:15:28,990 INFO L87 Difference]: Start difference. First operand 1429 states and 2021 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:29,108 INFO L93 Difference]: Finished difference Result 2840 states and 4023 transitions. [2024-10-13 06:15:29,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:29,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-13 06:15:29,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:29,115 INFO L225 Difference]: With dead ends: 2840 [2024-10-13 06:15:29,115 INFO L226 Difference]: Without dead ends: 1412 [2024-10-13 06:15:29,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:29,119 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 53 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:29,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 564 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-13 06:15:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1409. [2024-10-13 06:15:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1239 states have (on average 1.3615819209039548) internal successors, (1687), 1244 states have internal predecessors, (1687), 152 states have call successors, (152), 17 states have call predecessors, (152), 17 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2024-10-13 06:15:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1991 transitions. [2024-10-13 06:15:29,246 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1991 transitions. Word has length 116 [2024-10-13 06:15:29,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:29,246 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1991 transitions. [2024-10-13 06:15:29,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1991 transitions. [2024-10-13 06:15:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:15:29,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:29,248 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:29,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 06:15:29,248 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:29,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash -931799564, now seen corresponding path program 1 times [2024-10-13 06:15:29,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:29,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604707806] [2024-10-13 06:15:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:29,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:29,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:29,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604707806] [2024-10-13 06:15:29,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604707806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:29,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:29,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:15:29,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060479574] [2024-10-13 06:15:29,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:29,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:15:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:29,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:15:29,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:15:29,412 INFO L87 Difference]: Start difference. First operand 1409 states and 1991 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:29,531 INFO L93 Difference]: Finished difference Result 2513 states and 3553 transitions. [2024-10-13 06:15:29,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:29,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-13 06:15:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:29,538 INFO L225 Difference]: With dead ends: 2513 [2024-10-13 06:15:29,538 INFO L226 Difference]: Without dead ends: 1366 [2024-10-13 06:15:29,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:29,541 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 64 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:29,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 551 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2024-10-13 06:15:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1360. [2024-10-13 06:15:29,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1190 states have (on average 1.3512605042016808) internal successors, (1608), 1195 states have internal predecessors, (1608), 152 states have call successors, (152), 17 states have call predecessors, (152), 17 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2024-10-13 06:15:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1912 transitions. [2024-10-13 06:15:29,638 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1912 transitions. Word has length 116 [2024-10-13 06:15:29,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:29,638 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1912 transitions. [2024-10-13 06:15:29,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1912 transitions. [2024-10-13 06:15:29,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:15:29,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:29,640 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:29,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 06:15:29,641 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:29,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:29,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1298680799, now seen corresponding path program 1 times [2024-10-13 06:15:29,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:29,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949457103] [2024-10-13 06:15:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:29,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:29,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:29,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949457103] [2024-10-13 06:15:29,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949457103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:29,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:29,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:15:29,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768395032] [2024-10-13 06:15:29,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:29,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:15:29,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:29,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:15:29,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:15:29,852 INFO L87 Difference]: Start difference. First operand 1360 states and 1912 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:30,029 INFO L93 Difference]: Finished difference Result 2769 states and 3883 transitions. [2024-10-13 06:15:30,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:15:30,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-13 06:15:30,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:30,037 INFO L225 Difference]: With dead ends: 2769 [2024-10-13 06:15:30,038 INFO L226 Difference]: Without dead ends: 1410 [2024-10-13 06:15:30,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:15:30,041 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 67 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:30,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1116 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-10-13 06:15:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1394. [2024-10-13 06:15:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1224 states have (on average 1.338235294117647) internal successors, (1638), 1229 states have internal predecessors, (1638), 152 states have call successors, (152), 17 states have call predecessors, (152), 17 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2024-10-13 06:15:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1942 transitions. [2024-10-13 06:15:30,136 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1942 transitions. Word has length 116 [2024-10-13 06:15:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:30,136 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1942 transitions. [2024-10-13 06:15:30,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1942 transitions. [2024-10-13 06:15:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:15:30,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:30,138 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:30,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 06:15:30,138 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:30,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:30,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1721382625, now seen corresponding path program 1 times [2024-10-13 06:15:30,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:30,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668905870] [2024-10-13 06:15:30,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:30,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:30,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:30,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668905870] [2024-10-13 06:15:30,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668905870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:30,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:30,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:15:30,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613790509] [2024-10-13 06:15:30,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:30,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:15:30,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:30,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:15:30,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:15:30,441 INFO L87 Difference]: Start difference. First operand 1394 states and 1942 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 06:15:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:30,719 INFO L93 Difference]: Finished difference Result 2903 states and 4021 transitions. [2024-10-13 06:15:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:15:30,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 116 [2024-10-13 06:15:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:30,726 INFO L225 Difference]: With dead ends: 2903 [2024-10-13 06:15:30,727 INFO L226 Difference]: Without dead ends: 1510 [2024-10-13 06:15:30,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:15:30,730 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 330 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:30,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 837 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-10-13 06:15:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1505. [2024-10-13 06:15:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1319 states have (on average 1.3267626990144048) internal successors, (1750), 1327 states have internal predecessors, (1750), 158 states have call successors, (158), 27 states have call predecessors, (158), 27 states have return successors, (158), 150 states have call predecessors, (158), 158 states have call successors, (158) [2024-10-13 06:15:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2066 transitions. [2024-10-13 06:15:30,842 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2066 transitions. Word has length 116 [2024-10-13 06:15:30,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:30,843 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2066 transitions. [2024-10-13 06:15:30,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 06:15:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2066 transitions. [2024-10-13 06:15:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 06:15:30,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:30,845 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:30,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 06:15:30,845 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:30,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:30,845 INFO L85 PathProgramCache]: Analyzing trace with hash -511862782, now seen corresponding path program 1 times [2024-10-13 06:15:30,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:30,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701434322] [2024-10-13 06:15:30,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:30,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:31,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:31,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701434322] [2024-10-13 06:15:31,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701434322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:31,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:31,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 06:15:31,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485840305] [2024-10-13 06:15:31,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:31,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:15:31,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:15:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:15:31,718 INFO L87 Difference]: Start difference. First operand 1505 states and 2066 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:15:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:33,799 INFO L93 Difference]: Finished difference Result 2923 states and 4023 transitions. [2024-10-13 06:15:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 06:15:33,800 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2024-10-13 06:15:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:33,807 INFO L225 Difference]: With dead ends: 2923 [2024-10-13 06:15:33,807 INFO L226 Difference]: Without dead ends: 1710 [2024-10-13 06:15:33,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2024-10-13 06:15:33,810 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 633 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:33,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 2122 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 06:15:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2024-10-13 06:15:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1559. [2024-10-13 06:15:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1362 states have (on average 1.327459618208517) internal successors, (1808), 1370 states have internal predecessors, (1808), 168 states have call successors, (168), 28 states have call predecessors, (168), 28 states have return successors, (168), 160 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-13 06:15:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2144 transitions. [2024-10-13 06:15:33,926 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2144 transitions. Word has length 117 [2024-10-13 06:15:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:33,927 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2144 transitions. [2024-10-13 06:15:33,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:15:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2144 transitions. [2024-10-13 06:15:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 06:15:33,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:33,928 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:33,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 06:15:33,928 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:33,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:33,929 INFO L85 PathProgramCache]: Analyzing trace with hash -449823168, now seen corresponding path program 1 times [2024-10-13 06:15:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:33,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889067591] [2024-10-13 06:15:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:50,753 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 06:15:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:15:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:15:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:15:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:15:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:15:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:51,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889067591] [2024-10-13 06:15:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889067591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:51,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:51,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 06:15:51,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616058954] [2024-10-13 06:15:51,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:51,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 06:15:51,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 06:15:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:15:51,153 INFO L87 Difference]: Start difference. First operand 1559 states and 2144 transitions. Second operand has 14 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 06:15:59,690 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 54 DAG size of output: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 06:16:07,822 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 68 DAG size of output: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 06:16:16,135 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 92 DAG size of output: 88 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 06:16:24,257 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 59 DAG size of output: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 06:16:32,491 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 65 DAG size of output: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 06:16:41,075 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 56 DAG size of output: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)