./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.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 2be5ecf5348458671ab0cc252df5fcce5a265155e50eac356b5f3e450b866c41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:18:55,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:18:55,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:18:55,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:18:55,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:18:55,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:18:55,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:18:55,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:18:55,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:18:55,796 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:18:55,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:18:55,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:18:55,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:18:55,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:18:55,798 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:18:55,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:18:55,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:18:55,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:18:55,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:18:55,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:18:55,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:18:55,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:18:55,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:18:55,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:18:55,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:18:55,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:18:55,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:18:55,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:18:55,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:18:55,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:18:55,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:18:55,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:18:55,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:18:55,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:18:55,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:18:55,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:18:55,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:18:55,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:18:55,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:18:55,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:18:55,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:18:55,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:18:55,808 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 -> 2be5ecf5348458671ab0cc252df5fcce5a265155e50eac356b5f3e450b866c41 [2024-10-13 06:18:56,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:18:56,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:18:56,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:18:56,128 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:18:56,133 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:18:56,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.i [2024-10-13 06:18:57,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:18:57,949 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:18:57,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.i [2024-10-13 06:18:57,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df08d2dce/531ce2f50d294270b3b3d6134ffbeb24/FLAGd5423af1e [2024-10-13 06:18:57,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df08d2dce/531ce2f50d294270b3b3d6134ffbeb24 [2024-10-13 06:18:57,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:18:57,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:18:57,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:18:57,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:18:57,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:18:57,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:18:57" (1/1) ... [2024-10-13 06:18:57,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb47336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:57, skipping insertion in model container [2024-10-13 06:18:57,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:18:57" (1/1) ... [2024-10-13 06:18:58,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:18:58,201 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.i[915,928] [2024-10-13 06:18:58,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:18:58,270 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:18:58,281 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.i[915,928] [2024-10-13 06:18:58,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:18:58,352 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:18:58,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58 WrapperNode [2024-10-13 06:18:58,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:18:58,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:18:58,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:18:58,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:18:58,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (1/1) ... [2024-10-13 06:18:58,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (1/1) ... [2024-10-13 06:18:58,436 INFO L138 Inliner]: procedures = 26, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 453 [2024-10-13 06:18:58,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:18:58,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:18:58,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:18:58,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:18:58,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (1/1) ... [2024-10-13 06:18:58,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (1/1) ... [2024-10-13 06:18:58,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (1/1) ... [2024-10-13 06:18:58,513 INFO L175 MemorySlicer]: Split 122 memory accesses to 16 slices as follows [2, 3, 6, 6, 29, 6, 6, 14, 8, 7, 9, 8, 8, 3, 3, 4]. 24 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-10-13 06:18:58,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (1/1) ... [2024-10-13 06:18:58,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (1/1) ... [2024-10-13 06:18:58,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (1/1) ... [2024-10-13 06:18:58,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (1/1) ... [2024-10-13 06:18:58,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (1/1) ... [2024-10-13 06:18:58,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (1/1) ... [2024-10-13 06:18:58,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:18:58,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:18:58,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:18:58,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:18:58,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (1/1) ... [2024-10-13 06:18:58,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:18:58,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:18:58,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:18:58,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:18:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:18:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:18:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:18:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 06:18:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 06:18:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 06:18:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 06:18:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 06:18:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 06:18:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 06:18:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 06:18:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-13 06:18:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-13 06:18:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-13 06:18:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-13 06:18:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-13 06:18:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-13 06:18:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:18:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:18:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 06:18:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 06:18:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 06:18:58,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 06:18:58,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 06:18:58,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 06:18:58,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 06:18:58,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 06:18:58,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-13 06:18:58,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-13 06:18:58,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-13 06:18:58,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-13 06:18:58,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-13 06:18:58,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-13 06:18:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:18:58,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:18:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:18:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:18:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 06:18:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 06:18:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 06:18:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 06:18:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 06:18:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 06:18:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 06:18:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 06:18:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-13 06:18:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-13 06:18:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-13 06:18:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-13 06:18:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-13 06:18:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-13 06:18:58,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:18:58,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:18:58,882 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:18:58,885 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:18:59,470 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-13 06:18:59,470 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:18:59,532 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:18:59,533 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:18:59,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:18:59 BoogieIcfgContainer [2024-10-13 06:18:59,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:18:59,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:18:59,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:18:59,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:18:59,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:18:57" (1/3) ... [2024-10-13 06:18:59,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1414270a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:18:59, skipping insertion in model container [2024-10-13 06:18:59,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:18:58" (2/3) ... [2024-10-13 06:18:59,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1414270a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:18:59, skipping insertion in model container [2024-10-13 06:18:59,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:18:59" (3/3) ... [2024-10-13 06:18:59,543 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-5.i [2024-10-13 06:18:59,561 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:18:59,562 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:18:59,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:18:59,643 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;@384f51c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:18:59,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:18:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 66 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:18:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:18:59,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:18:59,662 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:18:59,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:18:59,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:18:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1626294328, now seen corresponding path program 1 times [2024-10-13 06:18:59,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:18:59,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140450270] [2024-10-13 06:18:59,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:18:59,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:18:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:00,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:00,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140450270] [2024-10-13 06:19:00,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140450270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:00,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:00,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:19:00,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310195981] [2024-10-13 06:19:00,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:00,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:19:00,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:00,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:19:00,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:19:00,474 INFO L87 Difference]: Start difference. First operand has 88 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 66 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:19:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:00,537 INFO L93 Difference]: Finished difference Result 173 states and 276 transitions. [2024-10-13 06:19:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:19:00,540 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2024-10-13 06:19:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:00,550 INFO L225 Difference]: With dead ends: 173 [2024-10-13 06:19:00,551 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 06:19:00,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:19:00,565 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:00,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 06:19:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 06:19:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:19:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2024-10-13 06:19:00,637 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 142 [2024-10-13 06:19:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:00,638 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2024-10-13 06:19:00,640 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:19:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2024-10-13 06:19:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:19:00,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:00,650 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:00,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:19:00,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:00,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:00,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1696479216, now seen corresponding path program 1 times [2024-10-13 06:19:00,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:00,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698940936] [2024-10-13 06:19:00,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:00,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:01,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:01,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698940936] [2024-10-13 06:19:01,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698940936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:01,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:01,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:19:01,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179791313] [2024-10-13 06:19:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:01,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:19:01,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:01,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:19:01,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:19:01,330 INFO L87 Difference]: Start difference. First operand 86 states and 124 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:01,411 INFO L93 Difference]: Finished difference Result 173 states and 250 transitions. [2024-10-13 06:19:01,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:19:01,415 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-10-13 06:19:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:01,418 INFO L225 Difference]: With dead ends: 173 [2024-10-13 06:19:01,418 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 06:19:01,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:19:01,420 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:01,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:19:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 06:19:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 06:19:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:19:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2024-10-13 06:19:01,435 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 142 [2024-10-13 06:19:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:01,437 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2024-10-13 06:19:01,438 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2024-10-13 06:19:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:19:01,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:01,441 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:01,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:19:01,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:01,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:01,442 INFO L85 PathProgramCache]: Analyzing trace with hash 420762677, now seen corresponding path program 1 times [2024-10-13 06:19:01,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:01,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418426857] [2024-10-13 06:19:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:01,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:01,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418426857] [2024-10-13 06:19:01,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418426857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:01,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:01,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:19:01,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786558330] [2024-10-13 06:19:01,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:01,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:19:01,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:01,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:19:01,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:19:01,748 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:01,814 INFO L93 Difference]: Finished difference Result 178 states and 255 transitions. [2024-10-13 06:19:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:19:01,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-10-13 06:19:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:01,821 INFO L225 Difference]: With dead ends: 178 [2024-10-13 06:19:01,821 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 06:19:01,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:19:01,823 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:01,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 343 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 06:19:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-13 06:19:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:19:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2024-10-13 06:19:01,845 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 144 [2024-10-13 06:19:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:01,846 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2024-10-13 06:19:01,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2024-10-13 06:19:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:19:01,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:01,852 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:01,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:19:01,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:01,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:01,854 INFO L85 PathProgramCache]: Analyzing trace with hash -388583949, now seen corresponding path program 1 times [2024-10-13 06:19:01,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:01,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485998815] [2024-10-13 06:19:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:01,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:02,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:02,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485998815] [2024-10-13 06:19:02,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485998815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:02,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:02,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:19:02,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939185858] [2024-10-13 06:19:02,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:02,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:19:02,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:02,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:19:02,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:19:02,130 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:02,186 INFO L93 Difference]: Finished difference Result 182 states and 259 transitions. [2024-10-13 06:19:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:19:02,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-10-13 06:19:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:02,189 INFO L225 Difference]: With dead ends: 182 [2024-10-13 06:19:02,189 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 06:19:02,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:19:02,192 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:02,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 344 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 06:19:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-13 06:19:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:19:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2024-10-13 06:19:02,201 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 144 [2024-10-13 06:19:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:02,202 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2024-10-13 06:19:02,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2024-10-13 06:19:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:19:02,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:02,205 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:02,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:19:02,206 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:02,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash -331325647, now seen corresponding path program 1 times [2024-10-13 06:19:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:02,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366062893] [2024-10-13 06:19:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:02,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:02,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366062893] [2024-10-13 06:19:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366062893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:02,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:02,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:19:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173545291] [2024-10-13 06:19:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:19:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:02,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:19:02,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:19:02,457 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:02,503 INFO L93 Difference]: Finished difference Result 186 states and 263 transitions. [2024-10-13 06:19:02,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:19:02,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-10-13 06:19:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:02,507 INFO L225 Difference]: With dead ends: 186 [2024-10-13 06:19:02,507 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 06:19:02,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:19:02,512 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:02,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:02,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 06:19:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-13 06:19:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:19:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2024-10-13 06:19:02,528 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 144 [2024-10-13 06:19:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:02,529 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2024-10-13 06:19:02,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2024-10-13 06:19:02,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:19:02,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:02,535 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:02,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:19:02,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:02,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash -331266065, now seen corresponding path program 1 times [2024-10-13 06:19:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:02,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61803864] [2024-10-13 06:19:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:02,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:02,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:03,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:03,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61803864] [2024-10-13 06:19:03,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61803864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:03,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:03,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:19:03,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112930533] [2024-10-13 06:19:03,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:03,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:19:03,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:03,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:19:03,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:19:03,016 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:03,047 INFO L93 Difference]: Finished difference Result 187 states and 263 transitions. [2024-10-13 06:19:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:19:03,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-10-13 06:19:03,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:03,051 INFO L225 Difference]: With dead ends: 187 [2024-10-13 06:19:03,052 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 06:19:03,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:19:03,054 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:03,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 06:19:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 06:19:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:19:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2024-10-13 06:19:03,076 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 144 [2024-10-13 06:19:03,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:03,077 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2024-10-13 06:19:03,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2024-10-13 06:19:03,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:19:03,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:03,081 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:03,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:19:03,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:03,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1352406572, now seen corresponding path program 1 times [2024-10-13 06:19:03,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:03,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142753679] [2024-10-13 06:19:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:03,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:03,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:03,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142753679] [2024-10-13 06:19:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142753679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:03,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:03,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:19:03,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740235295] [2024-10-13 06:19:03,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:03,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:19:03,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:19:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:19:03,403 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:03,460 INFO L93 Difference]: Finished difference Result 187 states and 261 transitions. [2024-10-13 06:19:03,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:19:03,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-10-13 06:19:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:03,463 INFO L225 Difference]: With dead ends: 187 [2024-10-13 06:19:03,465 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 06:19:03,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:19:03,467 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:03,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 06:19:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 06:19:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:19:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2024-10-13 06:19:03,481 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 146 [2024-10-13 06:19:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:03,481 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2024-10-13 06:19:03,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2024-10-13 06:19:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:19:03,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:03,485 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:03,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:19:03,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:03,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1253616982, now seen corresponding path program 1 times [2024-10-13 06:19:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:03,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161922601] [2024-10-13 06:19:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:03,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:03,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:03,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161922601] [2024-10-13 06:19:03,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161922601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:03,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:03,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:19:03,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417268782] [2024-10-13 06:19:03,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:03,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:19:03,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:03,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:19:03,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:19:03,857 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:03,907 INFO L93 Difference]: Finished difference Result 187 states and 259 transitions. [2024-10-13 06:19:03,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:19:03,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-10-13 06:19:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:03,909 INFO L225 Difference]: With dead ends: 187 [2024-10-13 06:19:03,909 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 06:19:03,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:19:03,910 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:03,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 06:19:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 06:19:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:19:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2024-10-13 06:19:03,928 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 146 [2024-10-13 06:19:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:03,928 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2024-10-13 06:19:03,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2024-10-13 06:19:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:19:03,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:03,931 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:03,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:19:03,931 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:03,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:03,931 INFO L85 PathProgramCache]: Analyzing trace with hash -26246696, now seen corresponding path program 1 times [2024-10-13 06:19:03,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:03,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976535168] [2024-10-13 06:19:03,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:03,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:05,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:05,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976535168] [2024-10-13 06:19:05,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976535168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:05,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:05,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:19:05,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19195034] [2024-10-13 06:19:05,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:05,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:19:05,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:05,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:19:05,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:19:05,986 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:19:06,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:06,631 INFO L93 Difference]: Finished difference Result 336 states and 465 transitions. [2024-10-13 06:19:06,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:19:06,632 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 146 [2024-10-13 06:19:06,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:06,634 INFO L225 Difference]: With dead ends: 336 [2024-10-13 06:19:06,634 INFO L226 Difference]: Without dead ends: 243 [2024-10-13 06:19:06,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:19:06,639 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 223 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:06,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 939 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:19:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-13 06:19:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 181. [2024-10-13 06:19:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 138 states have internal predecessors, (169), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 06:19:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 249 transitions. [2024-10-13 06:19:06,666 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 249 transitions. Word has length 146 [2024-10-13 06:19:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:06,667 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 249 transitions. [2024-10-13 06:19:06,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:19:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 249 transitions. [2024-10-13 06:19:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:19:06,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:06,669 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:06,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:19:06,670 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:06,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1532718106, now seen corresponding path program 1 times [2024-10-13 06:19:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:06,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556195702] [2024-10-13 06:19:06,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:06,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:06,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:06,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556195702] [2024-10-13 06:19:06,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556195702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:06,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:06,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:19:06,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913647645] [2024-10-13 06:19:06,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:06,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:19:06,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:19:06,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:19:06,968 INFO L87 Difference]: Start difference. First operand 181 states and 249 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:07,024 INFO L93 Difference]: Finished difference Result 367 states and 505 transitions. [2024-10-13 06:19:07,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:19:07,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-10-13 06:19:07,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:07,028 INFO L225 Difference]: With dead ends: 367 [2024-10-13 06:19:07,028 INFO L226 Difference]: Without dead ends: 187 [2024-10-13 06:19:07,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:19:07,030 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:07,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 444 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-13 06:19:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-10-13 06:19:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 144 states have (on average 1.2152777777777777) internal successors, (175), 144 states have internal predecessors, (175), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 06:19:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 255 transitions. [2024-10-13 06:19:07,049 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 255 transitions. Word has length 146 [2024-10-13 06:19:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:07,049 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 255 transitions. [2024-10-13 06:19:07,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 255 transitions. [2024-10-13 06:19:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:19:07,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:07,052 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:07,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:19:07,052 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:07,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:07,053 INFO L85 PathProgramCache]: Analyzing trace with hash 873320681, now seen corresponding path program 1 times [2024-10-13 06:19:07,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:07,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358996969] [2024-10-13 06:19:07,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:07,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:09,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:09,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358996969] [2024-10-13 06:19:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358996969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:09,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:09,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 06:19:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671398061] [2024-10-13 06:19:09,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:09,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 06:19:09,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 06:19:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:19:09,155 INFO L87 Difference]: Start difference. First operand 187 states and 255 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2024-10-13 06:19:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:09,890 INFO L93 Difference]: Finished difference Result 347 states and 476 transitions. [2024-10-13 06:19:09,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 06:19:09,891 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) Word has length 147 [2024-10-13 06:19:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:09,894 INFO L225 Difference]: With dead ends: 347 [2024-10-13 06:19:09,894 INFO L226 Difference]: Without dead ends: 251 [2024-10-13 06:19:09,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2024-10-13 06:19:09,896 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 253 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:09,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1379 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:19:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-13 06:19:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 95. [2024-10-13 06:19:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 73 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:19:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2024-10-13 06:19:09,918 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 147 [2024-10-13 06:19:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:09,919 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2024-10-13 06:19:09,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2024-10-13 06:19:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2024-10-13 06:19:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:19:09,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:09,922 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:09,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:19:09,923 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:09,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1280630248, now seen corresponding path program 1 times [2024-10-13 06:19:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:09,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917458846] [2024-10-13 06:19:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:09,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:10,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:10,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917458846] [2024-10-13 06:19:10,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917458846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:10,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:10,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:19:10,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668004239] [2024-10-13 06:19:10,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:10,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:19:10,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:10,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:19:10,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:19:10,254 INFO L87 Difference]: Start difference. First operand 95 states and 129 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:10,332 INFO L93 Difference]: Finished difference Result 239 states and 319 transitions. [2024-10-13 06:19:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:19:10,333 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2024-10-13 06:19:10,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:10,334 INFO L225 Difference]: With dead ends: 239 [2024-10-13 06:19:10,335 INFO L226 Difference]: Without dead ends: 145 [2024-10-13 06:19:10,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:19:10,336 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 47 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:10,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 430 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:19:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-13 06:19:10,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2024-10-13 06:19:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 115 states have (on average 1.2173913043478262) internal successors, (140), 116 states have internal predecessors, (140), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:19:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 188 transitions. [2024-10-13 06:19:10,353 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 188 transitions. Word has length 148 [2024-10-13 06:19:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:10,353 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 188 transitions. [2024-10-13 06:19:10,354 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 188 transitions. [2024-10-13 06:19:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:19:10,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:10,356 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:10,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:19:10,356 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:10,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1143921882, now seen corresponding path program 1 times [2024-10-13 06:19:10,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:10,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64576814] [2024-10-13 06:19:10,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:10,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:10,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:10,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64576814] [2024-10-13 06:19:10,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64576814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:10,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:10,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:19:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481012280] [2024-10-13 06:19:10,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:10,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:19:10,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:10,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:19:10,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:19:10,792 INFO L87 Difference]: Start difference. First operand 142 states and 188 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:10,851 INFO L93 Difference]: Finished difference Result 283 states and 375 transitions. [2024-10-13 06:19:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:19:10,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2024-10-13 06:19:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:10,854 INFO L225 Difference]: With dead ends: 283 [2024-10-13 06:19:10,854 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 06:19:10,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:19:10,856 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:10,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 06:19:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-13 06:19:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 115 states have (on average 1.2) internal successors, (138), 116 states have internal predecessors, (138), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:19:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2024-10-13 06:19:10,870 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 148 [2024-10-13 06:19:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:10,871 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2024-10-13 06:19:10,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2024-10-13 06:19:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 06:19:10,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:10,872 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:10,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:19:10,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:10,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash -313637823, now seen corresponding path program 1 times [2024-10-13 06:19:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921597367] [2024-10-13 06:19:10,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 06:19:11,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:11,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921597367] [2024-10-13 06:19:11,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921597367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:19:11,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663891403] [2024-10-13 06:19:11,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:11,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:19:11,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:19:11,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:19:11,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:19:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:12,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 06:19:12,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:19:12,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:19:12,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-13 06:19:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 10 proven. 426 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-13 06:19:12,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:19:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:13,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663891403] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:19:13,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:19:13,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 10] total 14 [2024-10-13 06:19:13,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771586253] [2024-10-13 06:19:13,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:13,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:19:13,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:13,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:19:13,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:19:13,033 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:13,129 INFO L93 Difference]: Finished difference Result 173 states and 224 transitions. [2024-10-13 06:19:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:19:13,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-10-13 06:19:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:13,131 INFO L225 Difference]: With dead ends: 173 [2024-10-13 06:19:13,131 INFO L226 Difference]: Without dead ends: 171 [2024-10-13 06:19:13,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:19:13,132 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 50 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:13,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 470 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-13 06:19:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2024-10-13 06:19:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 133 states have (on average 1.1729323308270676) internal successors, (156), 135 states have internal predecessors, (156), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:19:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 220 transitions. [2024-10-13 06:19:13,156 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 220 transitions. Word has length 150 [2024-10-13 06:19:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:13,158 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 220 transitions. [2024-10-13 06:19:13,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 220 transitions. [2024-10-13 06:19:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 06:19:13,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:13,160 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:13,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:19:13,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 06:19:13,365 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:13,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:13,366 INFO L85 PathProgramCache]: Analyzing trace with hash -313578241, now seen corresponding path program 1 times [2024-10-13 06:19:13,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:13,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821328600] [2024-10-13 06:19:13,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:13,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:13,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:14,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:14,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821328600] [2024-10-13 06:19:14,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821328600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:14,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:14,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:19:14,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480089309] [2024-10-13 06:19:14,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:14,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:19:14,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:14,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:19:14,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:19:14,011 INFO L87 Difference]: Start difference. First operand 170 states and 220 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:14,243 INFO L93 Difference]: Finished difference Result 455 states and 591 transitions. [2024-10-13 06:19:14,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:19:14,243 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-10-13 06:19:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:14,246 INFO L225 Difference]: With dead ends: 455 [2024-10-13 06:19:14,246 INFO L226 Difference]: Without dead ends: 306 [2024-10-13 06:19:14,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:19:14,249 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 122 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:14,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 668 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:19:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-13 06:19:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 289. [2024-10-13 06:19:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 216 states have (on average 1.1435185185185186) internal successors, (247), 218 states have internal predecessors, (247), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 06:19:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 375 transitions. [2024-10-13 06:19:14,299 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 375 transitions. Word has length 150 [2024-10-13 06:19:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:14,299 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 375 transitions. [2024-10-13 06:19:14,300 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 375 transitions. [2024-10-13 06:19:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 06:19:14,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:14,301 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:14,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:19:14,302 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:14,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:14,302 INFO L85 PathProgramCache]: Analyzing trace with hash -256319939, now seen corresponding path program 1 times [2024-10-13 06:19:14,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:14,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85314429] [2024-10-13 06:19:14,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:14,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:14,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:14,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85314429] [2024-10-13 06:19:14,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85314429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:14,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:14,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:19:14,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721222737] [2024-10-13 06:19:14,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:14,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:19:14,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:14,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:19:14,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:19:14,584 INFO L87 Difference]: Start difference. First operand 289 states and 375 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:14,663 INFO L93 Difference]: Finished difference Result 551 states and 712 transitions. [2024-10-13 06:19:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:19:14,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-10-13 06:19:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:14,666 INFO L225 Difference]: With dead ends: 551 [2024-10-13 06:19:14,666 INFO L226 Difference]: Without dead ends: 311 [2024-10-13 06:19:14,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:19:14,668 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 106 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:14,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 641 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-13 06:19:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 289. [2024-10-13 06:19:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 216 states have (on average 1.1296296296296295) internal successors, (244), 218 states have internal predecessors, (244), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 06:19:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 372 transitions. [2024-10-13 06:19:14,707 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 372 transitions. Word has length 150 [2024-10-13 06:19:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:14,707 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 372 transitions. [2024-10-13 06:19:14,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 372 transitions. [2024-10-13 06:19:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 06:19:14,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:14,709 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:14,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:19:14,709 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:14,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:14,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1065666565, now seen corresponding path program 1 times [2024-10-13 06:19:14,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:14,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549438841] [2024-10-13 06:19:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:14,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:14,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:14,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549438841] [2024-10-13 06:19:14,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549438841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:14,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:14,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:19:14,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129403598] [2024-10-13 06:19:14,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:14,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:19:14,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:14,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:19:14,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:19:14,938 INFO L87 Difference]: Start difference. First operand 289 states and 372 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:14,999 INFO L93 Difference]: Finished difference Result 538 states and 689 transitions. [2024-10-13 06:19:14,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:19:15,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-10-13 06:19:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:15,002 INFO L225 Difference]: With dead ends: 538 [2024-10-13 06:19:15,002 INFO L226 Difference]: Without dead ends: 298 [2024-10-13 06:19:15,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:19:15,004 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:15,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-13 06:19:15,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-10-13 06:19:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 225 states have (on average 1.1244444444444444) internal successors, (253), 227 states have internal predecessors, (253), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 06:19:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 381 transitions. [2024-10-13 06:19:15,042 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 381 transitions. Word has length 150 [2024-10-13 06:19:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:15,042 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 381 transitions. [2024-10-13 06:19:15,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 381 transitions. [2024-10-13 06:19:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 06:19:15,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:15,044 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:15,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:19:15,044 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:15,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash -308746224, now seen corresponding path program 1 times [2024-10-13 06:19:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259014721] [2024-10-13 06:19:15,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:15,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:15,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:15,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259014721] [2024-10-13 06:19:15,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259014721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:15,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:15,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:19:15,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271046306] [2024-10-13 06:19:15,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:15,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:19:15,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:19:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:19:15,812 INFO L87 Difference]: Start difference. First operand 298 states and 381 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-13 06:19:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:16,239 INFO L93 Difference]: Finished difference Result 472 states and 599 transitions. [2024-10-13 06:19:16,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:19:16,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 151 [2024-10-13 06:19:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:16,242 INFO L225 Difference]: With dead ends: 472 [2024-10-13 06:19:16,242 INFO L226 Difference]: Without dead ends: 317 [2024-10-13 06:19:16,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-13 06:19:16,245 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 234 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:16,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 869 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:19:16,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-13 06:19:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 311. [2024-10-13 06:19:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 233 states have (on average 1.1201716738197425) internal successors, (261), 235 states have internal predecessors, (261), 68 states have call successors, (68), 9 states have call predecessors, (68), 9 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 06:19:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 397 transitions. [2024-10-13 06:19:16,287 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 397 transitions. Word has length 151 [2024-10-13 06:19:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:16,288 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 397 transitions. [2024-10-13 06:19:16,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-13 06:19:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 397 transitions. [2024-10-13 06:19:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 06:19:16,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:16,290 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:16,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:19:16,290 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:16,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2115865488, now seen corresponding path program 1 times [2024-10-13 06:19:16,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:16,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585136784] [2024-10-13 06:19:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:16,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:16,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585136784] [2024-10-13 06:19:16,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585136784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:16,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:16,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:19:16,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030907681] [2024-10-13 06:19:16,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:16,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:19:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:16,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:19:16,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:19:16,550 INFO L87 Difference]: Start difference. First operand 311 states and 397 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:16,665 INFO L93 Difference]: Finished difference Result 485 states and 613 transitions. [2024-10-13 06:19:16,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:19:16,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2024-10-13 06:19:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:16,671 INFO L225 Difference]: With dead ends: 485 [2024-10-13 06:19:16,671 INFO L226 Difference]: Without dead ends: 317 [2024-10-13 06:19:16,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:19:16,672 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 54 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:16,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 567 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:19:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-13 06:19:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 266. [2024-10-13 06:19:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 197 states have (on average 1.1116751269035532) internal successors, (219), 198 states have internal predecessors, (219), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:19:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 339 transitions. [2024-10-13 06:19:16,713 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 339 transitions. Word has length 151 [2024-10-13 06:19:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:16,714 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 339 transitions. [2024-10-13 06:19:16,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 339 transitions. [2024-10-13 06:19:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 06:19:16,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:16,716 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:16,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 06:19:16,716 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:16,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1229082198, now seen corresponding path program 1 times [2024-10-13 06:19:16,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:16,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163668161] [2024-10-13 06:19:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:19:16,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658478906] [2024-10-13 06:19:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:16,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:19:16,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:19:16,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:19:16,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 06:19:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:17,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-13 06:19:17,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:19:18,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:19:18,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-13 06:19:18,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-10-13 06:19:18,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2024-10-13 06:19:18,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-10-13 06:19:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 508 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-10-13 06:19:18,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:19:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163668161] [2024-10-13 06:19:19,072 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:19:19,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658478906] [2024-10-13 06:19:19,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658478906] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:19:19,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:19:19,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-10-13 06:19:19,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840683862] [2024-10-13 06:19:19,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:19,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:19:19,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:19,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:19:19,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:19:19,076 INFO L87 Difference]: Start difference. First operand 266 states and 339 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:19,873 INFO L93 Difference]: Finished difference Result 616 states and 761 transitions. [2024-10-13 06:19:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:19:19,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-10-13 06:19:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:19,878 INFO L225 Difference]: With dead ends: 616 [2024-10-13 06:19:19,878 INFO L226 Difference]: Without dead ends: 399 [2024-10-13 06:19:19,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 292 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:19:19,880 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 52 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:19,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 373 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:19:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-13 06:19:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 267. [2024-10-13 06:19:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 220 states have (on average 1.1136363636363635) internal successors, (245), 220 states have internal predecessors, (245), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 06:19:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 325 transitions. [2024-10-13 06:19:19,925 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 325 transitions. Word has length 152 [2024-10-13 06:19:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:19,926 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 325 transitions. [2024-10-13 06:19:19,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 325 transitions. [2024-10-13 06:19:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 06:19:19,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:19,928 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:19,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 06:19:20,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-13 06:19:20,133 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:20,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:20,134 INFO L85 PathProgramCache]: Analyzing trace with hash 559920962, now seen corresponding path program 1 times [2024-10-13 06:19:20,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:20,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810451513] [2024-10-13 06:19:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:20,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:20,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:20,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810451513] [2024-10-13 06:19:20,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810451513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:20,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:20,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:19:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130100380] [2024-10-13 06:19:20,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:20,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:19:20,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:20,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:19:20,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:19:20,607 INFO L87 Difference]: Start difference. First operand 267 states and 325 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:20,744 INFO L93 Difference]: Finished difference Result 494 states and 608 transitions. [2024-10-13 06:19:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:19:20,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-10-13 06:19:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:20,747 INFO L225 Difference]: With dead ends: 494 [2024-10-13 06:19:20,747 INFO L226 Difference]: Without dead ends: 337 [2024-10-13 06:19:20,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:19:20,750 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 99 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:20,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 593 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:19:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-13 06:19:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 158. [2024-10-13 06:19:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 134 states have (on average 1.126865671641791) internal successors, (151), 134 states have internal predecessors, (151), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:19:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 191 transitions. [2024-10-13 06:19:20,773 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 191 transitions. Word has length 153 [2024-10-13 06:19:20,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:20,773 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 191 transitions. [2024-10-13 06:19:20,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 191 transitions. [2024-10-13 06:19:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 06:19:20,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:20,775 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:20,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 06:19:20,776 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:20,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:20,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1378220619, now seen corresponding path program 1 times [2024-10-13 06:19:20,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:20,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154387288] [2024-10-13 06:19:20,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:20,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:21,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:21,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154387288] [2024-10-13 06:19:21,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154387288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:21,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:21,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:19:21,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449101829] [2024-10-13 06:19:21,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:21,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:19:21,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:21,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:19:21,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:19:21,046 INFO L87 Difference]: Start difference. First operand 158 states and 191 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:21,131 INFO L93 Difference]: Finished difference Result 377 states and 450 transitions. [2024-10-13 06:19:21,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:19:21,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-10-13 06:19:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:21,133 INFO L225 Difference]: With dead ends: 377 [2024-10-13 06:19:21,133 INFO L226 Difference]: Without dead ends: 220 [2024-10-13 06:19:21,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:19:21,134 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 41 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:21,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 532 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:19:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-13 06:19:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 186. [2024-10-13 06:19:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.117283950617284) internal successors, (181), 162 states have internal predecessors, (181), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:19:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 221 transitions. [2024-10-13 06:19:21,154 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 221 transitions. Word has length 153 [2024-10-13 06:19:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:21,155 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 221 transitions. [2024-10-13 06:19:21,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 221 transitions. [2024-10-13 06:19:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:19:21,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:21,156 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:21,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 06:19:21,157 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:21,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash 988748987, now seen corresponding path program 1 times [2024-10-13 06:19:21,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:21,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961597170] [2024-10-13 06:19:21,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:21,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:22,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:22,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961597170] [2024-10-13 06:19:22,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961597170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:22,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:22,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:19:22,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302208490] [2024-10-13 06:19:22,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:22,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:19:22,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:19:22,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:19:22,376 INFO L87 Difference]: Start difference. First operand 186 states and 221 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:23,327 INFO L93 Difference]: Finished difference Result 566 states and 675 transitions. [2024-10-13 06:19:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 06:19:23,328 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-10-13 06:19:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:23,331 INFO L225 Difference]: With dead ends: 566 [2024-10-13 06:19:23,331 INFO L226 Difference]: Without dead ends: 381 [2024-10-13 06:19:23,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-13 06:19:23,333 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 146 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:23,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1182 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:19:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-13 06:19:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 371. [2024-10-13 06:19:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 308 states have (on average 1.0974025974025974) internal successors, (338), 309 states have internal predecessors, (338), 53 states have call successors, (53), 9 states have call predecessors, (53), 9 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-13 06:19:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 444 transitions. [2024-10-13 06:19:23,401 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 444 transitions. Word has length 154 [2024-10-13 06:19:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:23,401 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 444 transitions. [2024-10-13 06:19:23,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 444 transitions. [2024-10-13 06:19:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:19:23,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:23,404 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:23,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 06:19:23,404 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:23,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:23,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1246914425, now seen corresponding path program 1 times [2024-10-13 06:19:23,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:23,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031682284] [2024-10-13 06:19:23,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:23,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:23,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:23,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031682284] [2024-10-13 06:19:23,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031682284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:23,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:23,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:19:23,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917159163] [2024-10-13 06:19:23,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:23,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:19:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:23,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:19:23,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:19:23,879 INFO L87 Difference]: Start difference. First operand 371 states and 444 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:24,088 INFO L93 Difference]: Finished difference Result 861 states and 1026 transitions. [2024-10-13 06:19:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:19:24,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-10-13 06:19:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:24,092 INFO L225 Difference]: With dead ends: 861 [2024-10-13 06:19:24,092 INFO L226 Difference]: Without dead ends: 491 [2024-10-13 06:19:24,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:19:24,094 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 78 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:24,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 652 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:19:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-10-13 06:19:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2024-10-13 06:19:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 401 states have (on average 1.0822942643391522) internal successors, (434), 403 states have internal predecessors, (434), 72 states have call successors, (72), 13 states have call predecessors, (72), 13 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:19:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 578 transitions. [2024-10-13 06:19:24,159 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 578 transitions. Word has length 154 [2024-10-13 06:19:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:24,160 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 578 transitions. [2024-10-13 06:19:24,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 578 transitions. [2024-10-13 06:19:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:19:24,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:24,162 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:24,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 06:19:24,163 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:24,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:24,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1920014915, now seen corresponding path program 1 times [2024-10-13 06:19:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:24,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456850666] [2024-10-13 06:19:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:24,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456850666] [2024-10-13 06:19:24,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456850666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:24,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:24,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:19:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609426325] [2024-10-13 06:19:24,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:24,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:19:24,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:19:24,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:19:24,881 INFO L87 Difference]: Start difference. First operand 487 states and 578 transitions. Second operand has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-13 06:19:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:25,356 INFO L93 Difference]: Finished difference Result 1093 states and 1301 transitions. [2024-10-13 06:19:25,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:19:25,357 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 154 [2024-10-13 06:19:25,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:25,361 INFO L225 Difference]: With dead ends: 1093 [2024-10-13 06:19:25,361 INFO L226 Difference]: Without dead ends: 607 [2024-10-13 06:19:25,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:19:25,363 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 139 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:25,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 630 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:19:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-10-13 06:19:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 537. [2024-10-13 06:19:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 432 states have (on average 1.0694444444444444) internal successors, (462), 435 states have internal predecessors, (462), 88 states have call successors, (88), 16 states have call predecessors, (88), 16 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 06:19:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 638 transitions. [2024-10-13 06:19:25,459 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 638 transitions. Word has length 154 [2024-10-13 06:19:25,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:25,460 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 638 transitions. [2024-10-13 06:19:25,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-13 06:19:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 638 transitions. [2024-10-13 06:19:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:19:25,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:25,463 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:25,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 06:19:25,463 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:25,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1661849477, now seen corresponding path program 1 times [2024-10-13 06:19:25,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:25,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103860855] [2024-10-13 06:19:25,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:25,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:26,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:27,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:27,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103860855] [2024-10-13 06:19:27,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103860855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:27,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:27,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 06:19:27,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786656867] [2024-10-13 06:19:27,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:27,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 06:19:27,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:27,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 06:19:27,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:19:27,002 INFO L87 Difference]: Start difference. First operand 537 states and 638 transitions. Second operand has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-13 06:19:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:28,508 INFO L93 Difference]: Finished difference Result 1111 states and 1324 transitions. [2024-10-13 06:19:28,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 06:19:28,508 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 154 [2024-10-13 06:19:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:28,513 INFO L225 Difference]: With dead ends: 1111 [2024-10-13 06:19:28,513 INFO L226 Difference]: Without dead ends: 575 [2024-10-13 06:19:28,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2024-10-13 06:19:28,516 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 109 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:28,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1395 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:19:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-10-13 06:19:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 566. [2024-10-13 06:19:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 445 states have (on average 1.0629213483146067) internal successors, (473), 449 states have internal predecessors, (473), 101 states have call successors, (101), 19 states have call predecessors, (101), 19 states have return successors, (101), 97 states have call predecessors, (101), 101 states have call successors, (101) [2024-10-13 06:19:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 675 transitions. [2024-10-13 06:19:28,638 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 675 transitions. Word has length 154 [2024-10-13 06:19:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:28,639 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 675 transitions. [2024-10-13 06:19:28,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-13 06:19:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 675 transitions. [2024-10-13 06:19:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:19:28,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:28,641 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:28,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 06:19:28,641 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:28,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1734224111, now seen corresponding path program 1 times [2024-10-13 06:19:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:28,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789468120] [2024-10-13 06:19:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:28,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:28,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:28,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789468120] [2024-10-13 06:19:28,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789468120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:28,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:28,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:19:28,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965325828] [2024-10-13 06:19:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:28,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:19:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:19:28,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:19:28,945 INFO L87 Difference]: Start difference. First operand 566 states and 675 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:29,271 INFO L93 Difference]: Finished difference Result 1269 states and 1492 transitions. [2024-10-13 06:19:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:19:29,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-10-13 06:19:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:29,277 INFO L225 Difference]: With dead ends: 1269 [2024-10-13 06:19:29,277 INFO L226 Difference]: Without dead ends: 972 [2024-10-13 06:19:29,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:19:29,279 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 204 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:29,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 387 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:19:29,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2024-10-13 06:19:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 753. [2024-10-13 06:19:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 602 states have (on average 1.0681063122923589) internal successors, (643), 605 states have internal predecessors, (643), 128 states have call successors, (128), 22 states have call predecessors, (128), 22 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-13 06:19:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 899 transitions. [2024-10-13 06:19:29,432 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 899 transitions. Word has length 154 [2024-10-13 06:19:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:29,433 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 899 transitions. [2024-10-13 06:19:29,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 899 transitions. [2024-10-13 06:19:29,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:19:29,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:29,435 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:29,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 06:19:29,435 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:29,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:29,436 INFO L85 PathProgramCache]: Analyzing trace with hash 476992687, now seen corresponding path program 1 times [2024-10-13 06:19:29,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:29,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131652203] [2024-10-13 06:19:29,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:29,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:30,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:30,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131652203] [2024-10-13 06:19:30,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131652203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:30,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:30,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:19:30,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314506476] [2024-10-13 06:19:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:30,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:19:30,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:30,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:19:30,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:19:30,140 INFO L87 Difference]: Start difference. First operand 753 states and 899 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-13 06:19:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:30,719 INFO L93 Difference]: Finished difference Result 1322 states and 1567 transitions. [2024-10-13 06:19:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 06:19:30,720 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 154 [2024-10-13 06:19:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:30,725 INFO L225 Difference]: With dead ends: 1322 [2024-10-13 06:19:30,725 INFO L226 Difference]: Without dead ends: 870 [2024-10-13 06:19:30,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:19:30,727 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 221 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:30,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 985 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:19:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-10-13 06:19:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 719. [2024-10-13 06:19:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 568 states have (on average 1.0616197183098592) internal successors, (603), 571 states have internal predecessors, (603), 128 states have call successors, (128), 22 states have call predecessors, (128), 22 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-13 06:19:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 859 transitions. [2024-10-13 06:19:30,869 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 859 transitions. Word has length 154 [2024-10-13 06:19:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:30,870 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 859 transitions. [2024-10-13 06:19:30,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-13 06:19:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 859 transitions. [2024-10-13 06:19:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 06:19:30,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:30,872 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:30,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 06:19:30,873 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:30,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:30,873 INFO L85 PathProgramCache]: Analyzing trace with hash 85515454, now seen corresponding path program 1 times [2024-10-13 06:19:30,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:30,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753281974] [2024-10-13 06:19:30,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:30,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:34,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:34,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753281974] [2024-10-13 06:19:34,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753281974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:34,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:34,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-13 06:19:34,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030231419] [2024-10-13 06:19:34,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:34,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 06:19:34,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:34,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 06:19:34,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-13 06:19:34,747 INFO L87 Difference]: Start difference. First operand 719 states and 859 transitions. Second operand has 22 states, 20 states have (on average 3.0) internal successors, (60), 22 states have internal predecessors, (60), 7 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2024-10-13 06:19:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:37,661 INFO L93 Difference]: Finished difference Result 1185 states and 1405 transitions. [2024-10-13 06:19:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-13 06:19:37,662 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.0) internal successors, (60), 22 states have internal predecessors, (60), 7 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) Word has length 157 [2024-10-13 06:19:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:37,669 INFO L225 Difference]: With dead ends: 1185 [2024-10-13 06:19:37,669 INFO L226 Difference]: Without dead ends: 910 [2024-10-13 06:19:37,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=300, Invalid=1680, Unknown=0, NotChecked=0, Total=1980 [2024-10-13 06:19:37,672 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 206 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:37,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1585 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 06:19:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-10-13 06:19:37,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 773. [2024-10-13 06:19:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 606 states have (on average 1.0594059405940595) internal successors, (642), 610 states have internal predecessors, (642), 141 states have call successors, (141), 25 states have call predecessors, (141), 25 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2024-10-13 06:19:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 924 transitions. [2024-10-13 06:19:37,818 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 924 transitions. Word has length 157 [2024-10-13 06:19:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:37,822 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 924 transitions. [2024-10-13 06:19:37,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.0) internal successors, (60), 22 states have internal predecessors, (60), 7 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2024-10-13 06:19:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 924 transitions. [2024-10-13 06:19:37,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 06:19:37,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:37,824 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:37,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 06:19:37,824 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:37,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:37,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1045280766, now seen corresponding path program 1 times [2024-10-13 06:19:37,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:37,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126784458] [2024-10-13 06:19:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:37,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:19:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:19:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:19:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:19:39,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:39,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126784458] [2024-10-13 06:19:39,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126784458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:39,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:39,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:19:39,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279036854] [2024-10-13 06:19:39,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:39,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:19:39,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:39,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:19:39,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:19:39,556 INFO L87 Difference]: Start difference. First operand 773 states and 924 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:40,426 INFO L93 Difference]: Finished difference Result 1211 states and 1442 transitions. [2024-10-13 06:19:40,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 06:19:40,427 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-10-13 06:19:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:40,433 INFO L225 Difference]: With dead ends: 1211 [2024-10-13 06:19:40,434 INFO L226 Difference]: Without dead ends: 882 [2024-10-13 06:19:40,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:19:40,436 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 62 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:40,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1290 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:19:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-13 06:19:40,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 773. [2024-10-13 06:19:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 606 states have (on average 1.0594059405940595) internal successors, (642), 610 states have internal predecessors, (642), 141 states have call successors, (141), 25 states have call predecessors, (141), 25 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2024-10-13 06:19:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 924 transitions. [2024-10-13 06:19:40,621 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 924 transitions. Word has length 157 [2024-10-13 06:19:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:40,622 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 924 transitions. [2024-10-13 06:19:40,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:19:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 924 transitions. [2024-10-13 06:19:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-10-13 06:19:40,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:40,627 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:40,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 06:19:40,628 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:40,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash 364569950, now seen corresponding path program 1 times [2024-10-13 06:19:40,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:40,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734973975] [2024-10-13 06:19:40,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:40,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat