./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.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 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:23:17,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:23:17,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:23:17,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:23:17,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:23:17,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:23:17,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:23:17,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:23:17,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:23:17,465 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:23:17,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:23:17,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:23:17,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:23:17,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:23:17,467 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:23:17,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:23:17,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:23:17,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:23:17,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:23:17,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:23:17,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:23:17,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:23:17,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:23:17,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:23:17,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:23:17,476 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:23:17,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:23:17,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:23:17,477 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:23:17,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:23:17,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:23:17,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:23:17,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:23:17,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:23:17,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:23:17,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:23:17,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:23:17,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:23:17,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:23:17,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:23:17,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:23:17,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:23:17,482 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 -> 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 [2024-11-10 09:23:17,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:23:17,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:23:17,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:23:17,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:23:17,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:23:17,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-10 09:23:19,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:23:19,528 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:23:19,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-10 09:23:19,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef82b402/ec444f91270e43678048651058637018/FLAG00f969aba [2024-11-10 09:23:19,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef82b402/ec444f91270e43678048651058637018 [2024-11-10 09:23:19,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:23:19,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:23:19,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:23:19,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:23:19,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:23:19,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:19,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdecd12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19, skipping insertion in model container [2024-11-10 09:23:19,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:19,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:23:19,780 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2024-11-10 09:23:19,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:23:19,862 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:23:19,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2024-11-10 09:23:19,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:23:19,955 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:23:19,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19 WrapperNode [2024-11-10 09:23:19,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:23:19,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:23:19,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:23:19,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:23:19,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:19,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:20,042 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 523 [2024-11-10 09:23:20,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:23:20,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:23:20,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:23:20,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:23:20,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:20,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:20,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:20,116 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2024-11-10 09:23:20,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:20,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:20,147 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:20,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:20,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:20,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:20,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:23:20,177 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:23:20,177 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:23:20,178 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:23:20,178 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (1/1) ... [2024-11-10 09:23:20,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:23:20,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:23:20,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:23:20,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:23:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:23:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:23:20,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:23:20,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:23:20,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:23:20,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:23:20,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:23:20,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:23:20,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:23:20,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:23:20,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:23:20,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:23:20,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:23:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:23:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:23:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:23:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:23:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:23:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:23:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:23:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:23:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:23:20,277 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:23:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:23:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:23:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:23:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:23:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:23:20,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:23:20,419 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:23:20,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:23:21,002 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem90#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite99#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~bitwise110#1;havoc property_#t~ite123#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite143#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~mem142#1;havoc property_#t~mem141#1;havoc property_#t~short144#1; [2024-11-10 09:23:21,062 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-10 09:23:21,062 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:23:21,086 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:23:21,087 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:23:21,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:23:21 BoogieIcfgContainer [2024-11-10 09:23:21,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:23:21,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:23:21,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:23:21,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:23:21,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:23:19" (1/3) ... [2024-11-10 09:23:21,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb34d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:23:21, skipping insertion in model container [2024-11-10 09:23:21,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:23:19" (2/3) ... [2024-11-10 09:23:21,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb34d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:23:21, skipping insertion in model container [2024-11-10 09:23:21,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:23:21" (3/3) ... [2024-11-10 09:23:21,101 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-10 09:23:21,120 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:23:21,121 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:23:21,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:23:21,214 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;@55f2427a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:23:21,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:23:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 93 states have internal predecessors, (133), 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-11-10 09:23:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 09:23:21,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:21,232 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] [2024-11-10 09:23:21,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:21,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:21,238 INFO L85 PathProgramCache]: Analyzing trace with hash -882019087, now seen corresponding path program 1 times [2024-11-10 09:23:21,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:21,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797295253] [2024-11-10 09:23:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:21,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:21,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797295253] [2024-11-10 09:23:21,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797295253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:21,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:21,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:23:21,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507949716] [2024-11-10 09:23:21,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:21,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:23:21,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:21,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:23:21,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:23:21,736 INFO L87 Difference]: Start difference. First operand has 107 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 93 states have internal predecessors, (133), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-11-10 09:23:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:21,782 INFO L93 Difference]: Finished difference Result 206 states and 319 transitions. [2024-11-10 09:23:21,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:23:21,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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 102 [2024-11-10 09:23:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:21,795 INFO L225 Difference]: With dead ends: 206 [2024-11-10 09:23:21,795 INFO L226 Difference]: Without dead ends: 102 [2024-11-10 09:23:21,800 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-11-10 09:23:21,805 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:21,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:23:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-10 09:23:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-10 09:23:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 88 states have internal predecessors, (125), 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-11-10 09:23:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-11-10 09:23:21,858 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 102 [2024-11-10 09:23:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:21,859 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-11-10 09:23:21,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-11-10 09:23:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-11-10 09:23:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 09:23:21,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:21,865 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] [2024-11-10 09:23:21,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:23:21,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:21,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:21,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1002748999, now seen corresponding path program 1 times [2024-11-10 09:23:21,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:21,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37978023] [2024-11-10 09:23:21,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:21,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:22,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:22,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37978023] [2024-11-10 09:23:22,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37978023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:22,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:22,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:23:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46604322] [2024-11-10 09:23:22,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:22,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:23:22,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:22,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:23:22,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:23:22,332 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (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-11-10 09:23:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:22,385 INFO L93 Difference]: Finished difference Result 203 states and 298 transitions. [2024-11-10 09:23:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:23:22,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (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 102 [2024-11-10 09:23:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:22,388 INFO L225 Difference]: With dead ends: 203 [2024-11-10 09:23:22,389 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 09:23:22,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:23:22,392 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:22,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:23:22,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 09:23:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-10 09:23:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 90 states have internal predecessors, (127), 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-11-10 09:23:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2024-11-10 09:23:22,414 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 102 [2024-11-10 09:23:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:22,416 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2024-11-10 09:23:22,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (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-11-10 09:23:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2024-11-10 09:23:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:23:22,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:22,418 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] [2024-11-10 09:23:22,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:23:22,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:22,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:22,419 INFO L85 PathProgramCache]: Analyzing trace with hash 665791967, now seen corresponding path program 1 times [2024-11-10 09:23:22,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:22,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442911084] [2024-11-10 09:23:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:22,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:22,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:22,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442911084] [2024-11-10 09:23:22,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442911084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:22,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:22,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:23:22,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832971128] [2024-11-10 09:23:22,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:22,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:23:22,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:22,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:23:22,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:23:22,720 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-11-10 09:23:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:22,810 INFO L93 Difference]: Finished difference Result 251 states and 367 transitions. [2024-11-10 09:23:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:23:22,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 105 [2024-11-10 09:23:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:22,813 INFO L225 Difference]: With dead ends: 251 [2024-11-10 09:23:22,813 INFO L226 Difference]: Without dead ends: 150 [2024-11-10 09:23:22,814 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-11-10 09:23:22,815 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 62 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:22,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 289 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:23:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-10 09:23:22,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2024-11-10 09:23:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 107 states have (on average 1.439252336448598) internal successors, (154), 107 states have internal predecessors, (154), 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-11-10 09:23:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2024-11-10 09:23:22,825 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 105 [2024-11-10 09:23:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:22,826 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2024-11-10 09:23:22,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-11-10 09:23:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2024-11-10 09:23:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:23:22,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:22,828 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] [2024-11-10 09:23:22,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:23:22,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:22,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:22,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1552274648, now seen corresponding path program 1 times [2024-11-10 09:23:22,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:22,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449504537] [2024-11-10 09:23:22,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:22,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:24,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:24,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449504537] [2024-11-10 09:23:24,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449504537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:24,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:24,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 09:23:24,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117745143] [2024-11-10 09:23:24,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:24,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 09:23:24,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:24,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 09:23:24,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:23:24,694 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 09:23:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:25,351 INFO L93 Difference]: Finished difference Result 317 states and 463 transitions. [2024-11-10 09:23:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:23:25,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2024-11-10 09:23:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:25,355 INFO L225 Difference]: With dead ends: 317 [2024-11-10 09:23:25,358 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 09:23:25,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-10 09:23:25,360 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 419 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:25,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1053 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:23:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 09:23:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2024-11-10 09:23:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 176 states have (on average 1.4318181818181819) internal successors, (252), 177 states have internal predecessors, (252), 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-11-10 09:23:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 284 transitions. [2024-11-10 09:23:25,394 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 284 transitions. Word has length 105 [2024-11-10 09:23:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:25,396 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 284 transitions. [2024-11-10 09:23:25,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 09:23:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 284 transitions. [2024-11-10 09:23:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 09:23:25,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:25,402 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] [2024-11-10 09:23:25,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:23:25,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:25,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:25,403 INFO L85 PathProgramCache]: Analyzing trace with hash -843700895, now seen corresponding path program 1 times [2024-11-10 09:23:25,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:25,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979404840] [2024-11-10 09:23:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:25,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:23:25,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [534118951] [2024-11-10 09:23:25,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:25,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:23:25,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:23:25,578 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:23:25,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:23:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:25,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 09:23:25,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:23:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:26,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:23:26,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:26,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979404840] [2024-11-10 09:23:26,231 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 09:23:26,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534118951] [2024-11-10 09:23:26,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534118951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:26,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:26,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:23:26,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251224415] [2024-11-10 09:23:26,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:26,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:23:26,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:26,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:23:26,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:23:26,234 INFO L87 Difference]: Start difference. First operand 195 states and 284 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-11-10 09:23:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:26,429 INFO L93 Difference]: Finished difference Result 531 states and 776 transitions. [2024-11-10 09:23:26,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:23:26,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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 107 [2024-11-10 09:23:26,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:26,434 INFO L225 Difference]: With dead ends: 531 [2024-11-10 09:23:26,435 INFO L226 Difference]: Without dead ends: 339 [2024-11-10 09:23:26,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:23:26,438 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 137 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:26,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 366 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:23:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-10 09:23:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 267. [2024-11-10 09:23:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 235 states have (on average 1.4170212765957446) internal successors, (333), 236 states have internal predecessors, (333), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:23:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 389 transitions. [2024-11-10 09:23:26,472 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 389 transitions. Word has length 107 [2024-11-10 09:23:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:26,472 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 389 transitions. [2024-11-10 09:23:26,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-11-10 09:23:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 389 transitions. [2024-11-10 09:23:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 09:23:26,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:26,474 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] [2024-11-10 09:23:26,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:23:26,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:23:26,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:26,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:26,676 INFO L85 PathProgramCache]: Analyzing trace with hash -436254664, now seen corresponding path program 1 times [2024-11-10 09:23:26,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:26,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007198599] [2024-11-10 09:23:26,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:26,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:26,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:26,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:26,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:26,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:26,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:26,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:26,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:26,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:26,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:26,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:26,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:26,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:27,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:27,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007198599] [2024-11-10 09:23:27,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007198599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:27,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:27,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:23:27,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984535194] [2024-11-10 09:23:27,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:27,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:23:27,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:27,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:23:27,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:23:27,007 INFO L87 Difference]: Start difference. First operand 267 states and 389 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-11-10 09:23:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:27,246 INFO L93 Difference]: Finished difference Result 592 states and 854 transitions. [2024-11-10 09:23:27,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:23:27,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 108 [2024-11-10 09:23:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:27,250 INFO L225 Difference]: With dead ends: 592 [2024-11-10 09:23:27,252 INFO L226 Difference]: Without dead ends: 400 [2024-11-10 09:23:27,254 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-11-10 09:23:27,255 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 83 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:27,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 536 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:23:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-10 09:23:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 289. [2024-11-10 09:23:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 257 states have (on average 1.4085603112840468) internal successors, (362), 258 states have internal predecessors, (362), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:23:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 418 transitions. [2024-11-10 09:23:27,285 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 418 transitions. Word has length 108 [2024-11-10 09:23:27,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:27,285 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 418 transitions. [2024-11-10 09:23:27,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-11-10 09:23:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 418 transitions. [2024-11-10 09:23:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 09:23:27,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:27,288 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] [2024-11-10 09:23:27,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:23:27,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:27,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash -307171945, now seen corresponding path program 1 times [2024-11-10 09:23:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947044012] [2024-11-10 09:23:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:28,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:28,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947044012] [2024-11-10 09:23:28,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947044012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:28,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:28,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:23:28,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701549402] [2024-11-10 09:23:28,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:28,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:23:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:28,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:23:28,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:23:28,769 INFO L87 Difference]: Start difference. First operand 289 states and 418 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 09:23:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:29,417 INFO L93 Difference]: Finished difference Result 684 states and 989 transitions. [2024-11-10 09:23:29,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:23:29,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-10 09:23:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:29,421 INFO L225 Difference]: With dead ends: 684 [2024-11-10 09:23:29,422 INFO L226 Difference]: Without dead ends: 470 [2024-11-10 09:23:29,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:23:29,424 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 363 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:29,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 531 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:23:29,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-10 09:23:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 340. [2024-11-10 09:23:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 307 states have (on average 1.4201954397394136) internal successors, (436), 308 states have internal predecessors, (436), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:23:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 492 transitions. [2024-11-10 09:23:29,466 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 492 transitions. Word has length 108 [2024-11-10 09:23:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:29,466 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 492 transitions. [2024-11-10 09:23:29,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 09:23:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 492 transitions. [2024-11-10 09:23:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 09:23:29,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:29,468 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] [2024-11-10 09:23:29,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:23:29,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:29,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:29,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1949739062, now seen corresponding path program 1 times [2024-11-10 09:23:29,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:29,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635344653] [2024-11-10 09:23:29,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:29,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:30,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:30,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635344653] [2024-11-10 09:23:30,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635344653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:30,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:30,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 09:23:30,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176051079] [2024-11-10 09:23:30,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:30,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:23:30,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:30,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:23:30,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:23:30,519 INFO L87 Difference]: Start difference. First operand 340 states and 492 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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-11-10 09:23:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:31,230 INFO L93 Difference]: Finished difference Result 815 states and 1183 transitions. [2024-11-10 09:23:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:23:31,231 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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 108 [2024-11-10 09:23:31,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:31,234 INFO L225 Difference]: With dead ends: 815 [2024-11-10 09:23:31,234 INFO L226 Difference]: Without dead ends: 581 [2024-11-10 09:23:31,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-10 09:23:31,236 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 368 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:31,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1035 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:23:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-10 09:23:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 436. [2024-11-10 09:23:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 403 states have (on average 1.4392059553349876) internal successors, (580), 404 states have internal predecessors, (580), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:23:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 636 transitions. [2024-11-10 09:23:31,284 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 636 transitions. Word has length 108 [2024-11-10 09:23:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:31,285 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 636 transitions. [2024-11-10 09:23:31,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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-11-10 09:23:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 636 transitions. [2024-11-10 09:23:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 09:23:31,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:31,287 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-11-10 09:23:31,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:23:31,287 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:31,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:31,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2046038521, now seen corresponding path program 1 times [2024-11-10 09:23:31,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:31,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887938394] [2024-11-10 09:23:31,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:31,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:32,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:32,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887938394] [2024-11-10 09:23:32,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887938394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:32,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:32,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:23:32,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467411389] [2024-11-10 09:23:32,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:32,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:23:32,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:32,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:23:32,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:23:32,472 INFO L87 Difference]: Start difference. First operand 436 states and 636 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-11-10 09:23:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:33,429 INFO L93 Difference]: Finished difference Result 858 states and 1252 transitions. [2024-11-10 09:23:33,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:23:33,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 110 [2024-11-10 09:23:33,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:33,433 INFO L225 Difference]: With dead ends: 858 [2024-11-10 09:23:33,433 INFO L226 Difference]: Without dead ends: 572 [2024-11-10 09:23:33,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:23:33,435 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 312 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:33,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 944 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:23:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-10 09:23:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 443. [2024-11-10 09:23:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 410 states have (on average 1.4390243902439024) internal successors, (590), 411 states have internal predecessors, (590), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:23:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 646 transitions. [2024-11-10 09:23:33,473 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 646 transitions. Word has length 110 [2024-11-10 09:23:33,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:33,473 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 646 transitions. [2024-11-10 09:23:33,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-11-10 09:23:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 646 transitions. [2024-11-10 09:23:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 09:23:33,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:33,475 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-11-10 09:23:33,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:23:33,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:33,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:33,476 INFO L85 PathProgramCache]: Analyzing trace with hash -202968103, now seen corresponding path program 1 times [2024-11-10 09:23:33,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:33,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026095341] [2024-11-10 09:23:33,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:33,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:33,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:33,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026095341] [2024-11-10 09:23:33,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026095341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:33,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:33,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:23:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94983779] [2024-11-10 09:23:33,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:33,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:23:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:33,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:23:33,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:23:33,953 INFO L87 Difference]: Start difference. First operand 443 states and 646 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-11-10 09:23:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:34,299 INFO L93 Difference]: Finished difference Result 810 states and 1181 transitions. [2024-11-10 09:23:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:23:34,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-11-10 09:23:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:34,303 INFO L225 Difference]: With dead ends: 810 [2024-11-10 09:23:34,304 INFO L226 Difference]: Without dead ends: 522 [2024-11-10 09:23:34,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:23:34,307 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 82 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:34,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 656 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:23:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-10 09:23:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 449. [2024-11-10 09:23:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 416 states have (on average 1.4423076923076923) internal successors, (600), 417 states have internal predecessors, (600), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:23:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 656 transitions. [2024-11-10 09:23:34,349 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 656 transitions. Word has length 110 [2024-11-10 09:23:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:34,350 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 656 transitions. [2024-11-10 09:23:34,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-11-10 09:23:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 656 transitions. [2024-11-10 09:23:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 09:23:34,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:34,353 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-11-10 09:23:34,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:23:34,353 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:34,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:34,354 INFO L85 PathProgramCache]: Analyzing trace with hash -73885384, now seen corresponding path program 1 times [2024-11-10 09:23:34,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:34,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118679271] [2024-11-10 09:23:34,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:34,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:35,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:35,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118679271] [2024-11-10 09:23:35,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118679271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:35,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:23:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816818547] [2024-11-10 09:23:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:35,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:23:35,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:35,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:23:35,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:23:35,500 INFO L87 Difference]: Start difference. First operand 449 states and 656 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-11-10 09:23:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:36,334 INFO L93 Difference]: Finished difference Result 842 states and 1233 transitions. [2024-11-10 09:23:36,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:23:36,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 110 [2024-11-10 09:23:36,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:36,337 INFO L225 Difference]: With dead ends: 842 [2024-11-10 09:23:36,337 INFO L226 Difference]: Without dead ends: 548 [2024-11-10 09:23:36,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:23:36,341 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 255 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:36,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 733 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:23:36,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-10 09:23:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 473. [2024-11-10 09:23:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 440 states have (on average 1.4454545454545455) internal successors, (636), 441 states have internal predecessors, (636), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:23:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 692 transitions. [2024-11-10 09:23:36,380 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 692 transitions. Word has length 110 [2024-11-10 09:23:36,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:36,382 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 692 transitions. [2024-11-10 09:23:36,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-11-10 09:23:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 692 transitions. [2024-11-10 09:23:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:23:36,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:36,384 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-11-10 09:23:36,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:23:36,385 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:36,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1265571187, now seen corresponding path program 1 times [2024-11-10 09:23:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:36,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619401144] [2024-11-10 09:23:36,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:36,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:37,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:37,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619401144] [2024-11-10 09:23:37,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619401144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:37,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:37,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 09:23:37,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275083301] [2024-11-10 09:23:37,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:37,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:23:37,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:37,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:23:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:23:37,421 INFO L87 Difference]: Start difference. First operand 473 states and 692 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 09:23:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:38,281 INFO L93 Difference]: Finished difference Result 920 states and 1338 transitions. [2024-11-10 09:23:38,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:23:38,282 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2024-11-10 09:23:38,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:38,286 INFO L225 Difference]: With dead ends: 920 [2024-11-10 09:23:38,286 INFO L226 Difference]: Without dead ends: 612 [2024-11-10 09:23:38,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:23:38,287 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 406 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:38,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 751 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:23:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-10 09:23:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 483. [2024-11-10 09:23:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 450 states have (on average 1.44) internal successors, (648), 451 states have internal predecessors, (648), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:23:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 704 transitions. [2024-11-10 09:23:38,329 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 704 transitions. Word has length 111 [2024-11-10 09:23:38,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:38,329 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 704 transitions. [2024-11-10 09:23:38,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 09:23:38,330 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 704 transitions. [2024-11-10 09:23:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:23:38,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:38,331 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-11-10 09:23:38,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:23:38,331 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:38,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:38,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1394653906, now seen corresponding path program 1 times [2024-11-10 09:23:38,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:38,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578110420] [2024-11-10 09:23:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:39,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:39,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578110420] [2024-11-10 09:23:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578110420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:39,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:39,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 09:23:39,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042775058] [2024-11-10 09:23:39,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:39,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:23:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:39,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:23:39,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:23:39,790 INFO L87 Difference]: Start difference. First operand 483 states and 704 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 09:23:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:40,661 INFO L93 Difference]: Finished difference Result 857 states and 1252 transitions. [2024-11-10 09:23:40,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:23:40,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2024-11-10 09:23:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:40,665 INFO L225 Difference]: With dead ends: 857 [2024-11-10 09:23:40,665 INFO L226 Difference]: Without dead ends: 539 [2024-11-10 09:23:40,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:23:40,667 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 441 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:40,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 765 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:23:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-10 09:23:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 473. [2024-11-10 09:23:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 440 states have (on average 1.4363636363636363) internal successors, (632), 441 states have internal predecessors, (632), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:23:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 688 transitions. [2024-11-10 09:23:40,701 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 688 transitions. Word has length 111 [2024-11-10 09:23:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:40,702 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 688 transitions. [2024-11-10 09:23:40,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 09:23:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 688 transitions. [2024-11-10 09:23:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 09:23:40,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:40,703 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-11-10 09:23:40,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:23:40,704 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:40,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:40,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2019385797, now seen corresponding path program 1 times [2024-11-10 09:23:40,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:40,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412203192] [2024-11-10 09:23:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:40,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:41,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:41,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412203192] [2024-11-10 09:23:41,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412203192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:41,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:41,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:23:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87694111] [2024-11-10 09:23:41,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:41,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:23:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:41,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:23:41,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:23:41,315 INFO L87 Difference]: Start difference. First operand 473 states and 688 transitions. Second operand has 8 states, 6 states have (on average 9.166666666666666) internal successors, (55), 8 states have internal predecessors, (55), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-10 09:23:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:41,767 INFO L93 Difference]: Finished difference Result 811 states and 1187 transitions. [2024-11-10 09:23:41,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:23:41,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.166666666666666) internal successors, (55), 8 states have internal predecessors, (55), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 112 [2024-11-10 09:23:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:41,770 INFO L225 Difference]: With dead ends: 811 [2024-11-10 09:23:41,770 INFO L226 Difference]: Without dead ends: 473 [2024-11-10 09:23:41,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:23:41,775 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 120 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:41,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 533 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:23:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-10 09:23:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2024-11-10 09:23:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 440 states have (on average 1.4318181818181819) internal successors, (630), 441 states have internal predecessors, (630), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:23:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 686 transitions. [2024-11-10 09:23:41,815 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 686 transitions. Word has length 112 [2024-11-10 09:23:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:41,815 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 686 transitions. [2024-11-10 09:23:41,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.166666666666666) internal successors, (55), 8 states have internal predecessors, (55), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-10 09:23:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 686 transitions. [2024-11-10 09:23:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 09:23:41,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:41,817 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-11-10 09:23:41,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:23:41,817 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:41,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:41,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2086392550, now seen corresponding path program 1 times [2024-11-10 09:23:41,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:41,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383185196] [2024-11-10 09:23:41,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:41,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:23:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:23:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:23:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:23:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:23:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:23:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:23:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:23:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:23:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:23:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:23:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:23:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:23:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:23:44,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:23:44,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383185196] [2024-11-10 09:23:44,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383185196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:44,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:44,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-10 09:23:44,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271424946] [2024-11-10 09:23:44,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:44,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 09:23:44,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:23:44,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 09:23:44,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:23:44,224 INFO L87 Difference]: Start difference. First operand 473 states and 686 transitions. Second operand has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 09:23:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:47,258 INFO L93 Difference]: Finished difference Result 924 states and 1340 transitions. [2024-11-10 09:23:47,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 09:23:47,259 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2024-11-10 09:23:47,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:47,262 INFO L225 Difference]: With dead ends: 924 [2024-11-10 09:23:47,263 INFO L226 Difference]: Without dead ends: 616 [2024-11-10 09:23:47,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 09:23:47,265 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 425 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:47,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 2698 Invalid, 2034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1997 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 09:23:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-10 09:23:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 537. [2024-11-10 09:23:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 504 states have (on average 1.4365079365079365) internal successors, (724), 505 states have internal predecessors, (724), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:23:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 780 transitions. [2024-11-10 09:23:47,303 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 780 transitions. Word has length 112 [2024-11-10 09:23:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:47,304 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 780 transitions. [2024-11-10 09:23:47,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 09:23:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 780 transitions. [2024-11-10 09:23:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 09:23:47,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:47,305 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-11-10 09:23:47,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 09:23:47,306 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:47,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:47,306 INFO L85 PathProgramCache]: Analyzing trace with hash 871733681, now seen corresponding path program 1 times [2024-11-10 09:23:47,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:23:47,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884074070] [2024-11-10 09:23:47,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:47,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:23:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat