./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-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b28c8175bc39dd1c459be6d9349fe3be895f115cd8cddc9719a89a6e0edbf727 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:43:21,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:43:21,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:43:21,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:43:21,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:43:21,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:43:21,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:43:21,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:43:21,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:43:21,144 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:43:21,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:43:21,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:43:21,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:43:21,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:43:21,148 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:43:21,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:43:21,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:43:21,150 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:43:21,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:43:21,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:43:21,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:43:21,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:43:21,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:43:21,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:43:21,152 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:43:21,152 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:43:21,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:43:21,153 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:43:21,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:43:21,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:43:21,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:43:21,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:43:21,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:43:21,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:43:21,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:43:21,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:43:21,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:43:21,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:43:21,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:43:21,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:43:21,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:43:21,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:43:21,158 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b28c8175bc39dd1c459be6d9349fe3be895f115cd8cddc9719a89a6e0edbf727 [2024-10-11 13:43:21,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:43:21,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:43:21,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:43:21,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:43:21,455 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:43:21,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i [2024-10-11 13:43:22,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:43:23,112 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:43:23,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i [2024-10-11 13:43:23,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8d10d88f8/44349501910f4aaabaaf8187cb86fb4d/FLAGc40f55dd7 [2024-10-11 13:43:23,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8d10d88f8/44349501910f4aaabaaf8187cb86fb4d [2024-10-11 13:43:23,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:43:23,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:43:23,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:43:23,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:43:23,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:43:23,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d97398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23, skipping insertion in model container [2024-10-11 13:43:23,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:43:23,387 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-89.i[916,929] [2024-10-11 13:43:23,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:43:23,491 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:43:23,503 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-89.i[916,929] [2024-10-11 13:43:23,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:43:23,546 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:43:23,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23 WrapperNode [2024-10-11 13:43:23,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:43:23,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:43:23,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:43:23,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:43:23,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,622 INFO L138 Inliner]: procedures = 26, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2024-10-11 13:43:23,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:43:23,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:43:23,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:43:23,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:43:23,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,675 INFO L175 MemorySlicer]: Split 107 memory accesses to 13 slices as follows [2, 7, 13, 12, 6, 12, 9, 8, 12, 7, 5, 10, 4]. 12 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1]. [2024-10-11 13:43:23,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:43:23,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:43:23,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:43:23,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:43:23,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (1/1) ... [2024-10-11 13:43:23,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:43:23,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:43:23,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:43:23,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:43:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:43:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:43:23,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:43:23,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:43:23,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:43:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:43:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:43:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:43:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:43:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:43:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:43:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:43:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 13:43:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 13:43:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:43:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:43:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:43:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:43:23,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:43:23,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:43:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:43:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:43:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:43:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:43:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:43:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 13:43:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 13:43:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:43:23,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:43:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:43:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:43:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:43:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:43:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:43:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:43:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:43:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:43:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:43:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:43:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:43:23,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 13:43:23,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 13:43:23,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:43:23,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:43:24,046 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:43:24,049 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:43:24,579 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-11 13:43:24,580 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:43:24,624 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:43:24,625 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:43:24,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:24 BoogieIcfgContainer [2024-10-11 13:43:24,626 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:43:24,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:43:24,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:43:24,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:43:24,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:43:23" (1/3) ... [2024-10-11 13:43:24,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e56d778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:43:24, skipping insertion in model container [2024-10-11 13:43:24,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:23" (2/3) ... [2024-10-11 13:43:24,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e56d778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:43:24, skipping insertion in model container [2024-10-11 13:43:24,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:24" (3/3) ... [2024-10-11 13:43:24,638 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-89.i [2024-10-11 13:43:24,657 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:43:24,657 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:43:24,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:43:24,750 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;@404542f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:43:24,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:43:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 13:43:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:43:24,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:24,771 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:24,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:24,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1214591593, now seen corresponding path program 1 times [2024-10-11 13:43:24,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:24,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501761580] [2024-10-11 13:43:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:43:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:43:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:43:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:43:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:43:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:43:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:43:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:43:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:43:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 13:43:25,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:25,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501761580] [2024-10-11 13:43:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501761580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:25,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:25,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:43:25,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079447431] [2024-10-11 13:43:25,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:25,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:43:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:25,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:43:25,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:43:25,265 INFO L87 Difference]: Start difference. First operand has 95 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 13:43:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:25,313 INFO L93 Difference]: Finished difference Result 187 states and 297 transitions. [2024-10-11 13:43:25,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:43:25,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-10-11 13:43:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:25,325 INFO L225 Difference]: With dead ends: 187 [2024-10-11 13:43:25,326 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:43:25,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:43:25,335 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:25,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:43:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:43:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:43:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 13:43:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2024-10-11 13:43:25,395 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 104 [2024-10-11 13:43:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:25,396 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2024-10-11 13:43:25,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 13:43:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2024-10-11 13:43:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:43:25,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:25,403 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:25,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:43:25,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:25,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:25,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1616983823, now seen corresponding path program 1 times [2024-10-11 13:43:25,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:25,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163600755] [2024-10-11 13:43:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:25,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:43:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:43:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:43:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:43:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:43:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:43:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:43:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:43:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:43:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 13:43:25,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:25,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163600755] [2024-10-11 13:43:25,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163600755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:25,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:25,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:43:25,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143501169] [2024-10-11 13:43:25,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:25,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:43:25,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:25,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:43:25,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:25,905 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:25,967 INFO L93 Difference]: Finished difference Result 188 states and 275 transitions. [2024-10-11 13:43:25,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:43:25,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 13:43:25,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:25,972 INFO L225 Difference]: With dead ends: 188 [2024-10-11 13:43:25,972 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 13:43:25,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:25,974 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:25,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 380 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:43:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 13:43:25,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-11 13:43:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 13:43:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 138 transitions. [2024-10-11 13:43:25,987 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 138 transitions. Word has length 104 [2024-10-11 13:43:25,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:25,992 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 138 transitions. [2024-10-11 13:43:25,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:25,993 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 138 transitions. [2024-10-11 13:43:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:43:25,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:25,994 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:25,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:43:25,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:25,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:25,995 INFO L85 PathProgramCache]: Analyzing trace with hash 807637197, now seen corresponding path program 1 times [2024-10-11 13:43:25,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:25,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777483365] [2024-10-11 13:43:25,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:25,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:43:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:43:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:43:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:43:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:43:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:43:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:43:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:43:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:43:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 13:43:26,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:26,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777483365] [2024-10-11 13:43:26,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777483365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:26,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:26,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:43:26,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841179611] [2024-10-11 13:43:26,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:26,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:43:26,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:26,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:43:26,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:26,248 INFO L87 Difference]: Start difference. First operand 95 states and 138 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:26,298 INFO L93 Difference]: Finished difference Result 192 states and 279 transitions. [2024-10-11 13:43:26,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:43:26,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 13:43:26,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:26,301 INFO L225 Difference]: With dead ends: 192 [2024-10-11 13:43:26,301 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 13:43:26,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:26,303 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:26,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 381 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:43:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 13:43:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-11 13:43:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 13:43:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-10-11 13:43:26,312 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 104 [2024-10-11 13:43:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:26,313 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-10-11 13:43:26,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-10-11 13:43:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:43:26,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:26,315 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:26,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:43:26,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:26,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:26,316 INFO L85 PathProgramCache]: Analyzing trace with hash 864895499, now seen corresponding path program 1 times [2024-10-11 13:43:26,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:26,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116260413] [2024-10-11 13:43:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:26,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:43:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:43:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:43:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:43:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:43:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:43:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:43:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:43:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:43:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 13:43:26,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:26,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116260413] [2024-10-11 13:43:26,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116260413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:26,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:26,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:43:26,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836682871] [2024-10-11 13:43:26,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:26,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:43:26,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:26,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:43:26,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:26,534 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:26,573 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2024-10-11 13:43:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:43:26,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 13:43:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:26,576 INFO L225 Difference]: With dead ends: 196 [2024-10-11 13:43:26,576 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 13:43:26,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:26,578 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:26,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:43:26,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 13:43:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-11 13:43:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 13:43:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2024-10-11 13:43:26,594 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 142 transitions. Word has length 104 [2024-10-11 13:43:26,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:26,595 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 142 transitions. [2024-10-11 13:43:26,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 142 transitions. [2024-10-11 13:43:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:43:26,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:26,596 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:26,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:43:26,597 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:26,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 864955081, now seen corresponding path program 1 times [2024-10-11 13:43:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493156847] [2024-10-11 13:43:26,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:26,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:43:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:43:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:43:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:43:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:43:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:43:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:43:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:43:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:43:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 13:43:27,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:27,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493156847] [2024-10-11 13:43:27,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493156847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:27,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:27,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:43:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198240238] [2024-10-11 13:43:27,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:27,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:43:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:27,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:43:27,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:43:27,948 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:28,292 INFO L93 Difference]: Finished difference Result 274 states and 391 transitions. [2024-10-11 13:43:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:43:28,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 13:43:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:28,294 INFO L225 Difference]: With dead ends: 274 [2024-10-11 13:43:28,295 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 13:43:28,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:43:28,296 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 98 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:28,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 924 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:43:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 13:43:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2024-10-11 13:43:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.388157894736842) internal successors, (211), 153 states have internal predecessors, (211), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:43:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 247 transitions. [2024-10-11 13:43:28,310 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 247 transitions. Word has length 104 [2024-10-11 13:43:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:28,311 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 247 transitions. [2024-10-11 13:43:28,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 247 transitions. [2024-10-11 13:43:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:43:28,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:28,313 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:28,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:43:28,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:28,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:28,314 INFO L85 PathProgramCache]: Analyzing trace with hash -414908597, now seen corresponding path program 1 times [2024-10-11 13:43:28,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:28,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042779052] [2024-10-11 13:43:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:28,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:43:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:43:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:43:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:43:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:43:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:43:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:43:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:43:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:43:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 13:43:28,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042779052] [2024-10-11 13:43:28,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042779052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:28,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:28,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:43:28,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911360041] [2024-10-11 13:43:28,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:28,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:43:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:43:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:43:28,655 INFO L87 Difference]: Start difference. First operand 173 states and 247 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:28,755 INFO L93 Difference]: Finished difference Result 350 states and 496 transitions. [2024-10-11 13:43:28,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:43:28,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 13:43:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:28,759 INFO L225 Difference]: With dead ends: 350 [2024-10-11 13:43:28,759 INFO L226 Difference]: Without dead ends: 178 [2024-10-11 13:43:28,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:43:28,762 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 167 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:28,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 383 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:43:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-11 13:43:28,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2024-10-11 13:43:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 154 states have (on average 1.3766233766233766) internal successors, (212), 155 states have internal predecessors, (212), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:43:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 248 transitions. [2024-10-11 13:43:28,789 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 248 transitions. Word has length 104 [2024-10-11 13:43:28,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:28,789 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 248 transitions. [2024-10-11 13:43:28,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 248 transitions. [2024-10-11 13:43:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:43:28,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:28,791 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:28,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:43:28,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:28,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:28,796 INFO L85 PathProgramCache]: Analyzing trace with hash 993118848, now seen corresponding path program 1 times [2024-10-11 13:43:28,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:28,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791831122] [2024-10-11 13:43:28,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:28,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:43:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:43:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:43:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:43:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:43:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:43:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:43:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:43:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:43:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 13:43:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791831122] [2024-10-11 13:43:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791831122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:30,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:30,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:43:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525890566] [2024-10-11 13:43:30,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:30,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:43:30,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:30,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:43:30,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:43:30,070 INFO L87 Difference]: Start difference. First operand 176 states and 248 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 13:43:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:30,566 INFO L93 Difference]: Finished difference Result 579 states and 818 transitions. [2024-10-11 13:43:30,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:43:30,567 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 104 [2024-10-11 13:43:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:30,570 INFO L225 Difference]: With dead ends: 579 [2024-10-11 13:43:30,570 INFO L226 Difference]: Without dead ends: 404 [2024-10-11 13:43:30,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:43:30,572 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 447 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:30,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 619 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:43:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-11 13:43:30,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 357. [2024-10-11 13:43:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 314 states have (on average 1.3821656050955413) internal successors, (434), 316 states have internal predecessors, (434), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:43:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 506 transitions. [2024-10-11 13:43:30,611 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 506 transitions. Word has length 104 [2024-10-11 13:43:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:30,611 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 506 transitions. [2024-10-11 13:43:30,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 13:43:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 506 transitions. [2024-10-11 13:43:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:43:30,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:30,615 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:30,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:43:30,616 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:30,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1287656907, now seen corresponding path program 1 times [2024-10-11 13:43:30,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:30,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222280737] [2024-10-11 13:43:30,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:43:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:43:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:43:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:43:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:43:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:43:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:43:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:43:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:43:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 13:43:30,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:30,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222280737] [2024-10-11 13:43:30,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222280737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:30,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:30,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:43:30,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028155400] [2024-10-11 13:43:30,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:30,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:43:30,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:30,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:43:30,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:43:30,890 INFO L87 Difference]: Start difference. First operand 357 states and 506 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:30,994 INFO L93 Difference]: Finished difference Result 835 states and 1180 transitions. [2024-10-11 13:43:30,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:43:30,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 13:43:30,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:30,999 INFO L225 Difference]: With dead ends: 835 [2024-10-11 13:43:30,999 INFO L226 Difference]: Without dead ends: 479 [2024-10-11 13:43:31,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:43:31,002 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 87 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:31,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 547 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:43:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-11 13:43:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 473. [2024-10-11 13:43:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 422 states have (on average 1.3838862559241707) internal successors, (584), 426 states have internal predecessors, (584), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 13:43:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 668 transitions. [2024-10-11 13:43:31,043 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 668 transitions. Word has length 104 [2024-10-11 13:43:31,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:31,043 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 668 transitions. [2024-10-11 13:43:31,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 668 transitions. [2024-10-11 13:43:31,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:43:31,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:31,045 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:31,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:43:31,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:31,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:31,046 INFO L85 PathProgramCache]: Analyzing trace with hash 7793229, now seen corresponding path program 1 times [2024-10-11 13:43:31,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:31,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087933111] [2024-10-11 13:43:31,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:31,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:43:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:43:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:43:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:43:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:43:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:43:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:43:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:43:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:43:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 13:43:31,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:31,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087933111] [2024-10-11 13:43:31,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087933111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:31,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:31,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:43:31,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958321468] [2024-10-11 13:43:31,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:31,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:43:31,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:31,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:43:31,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:43:31,607 INFO L87 Difference]: Start difference. First operand 473 states and 668 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:31,793 INFO L93 Difference]: Finished difference Result 1017 states and 1434 transitions. [2024-10-11 13:43:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:43:31,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 13:43:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:31,797 INFO L225 Difference]: With dead ends: 1017 [2024-10-11 13:43:31,798 INFO L226 Difference]: Without dead ends: 545 [2024-10-11 13:43:31,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:43:31,799 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 131 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:31,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1085 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:43:31,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-11 13:43:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 523. [2024-10-11 13:43:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 450 states have (on average 1.3577777777777778) internal successors, (611), 454 states have internal predecessors, (611), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 13:43:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 735 transitions. [2024-10-11 13:43:31,835 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 735 transitions. Word has length 104 [2024-10-11 13:43:31,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:31,835 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 735 transitions. [2024-10-11 13:43:31,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 13:43:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 735 transitions. [2024-10-11 13:43:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:43:31,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:31,837 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:31,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:43:31,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:31,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2074942144, now seen corresponding path program 1 times [2024-10-11 13:43:31,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:31,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147297547] [2024-10-11 13:43:31,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat