./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-62.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02f4d89ad8ae68bf7980f37a0875d8dc9742c5b53631541ef266f31c83f1917f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:57:14,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:57:14,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:57:14,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:57:14,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:57:14,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:57:14,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:57:14,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:57:14,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:57:14,894 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:57:14,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:57:14,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:57:14,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:57:14,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:57:14,896 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:57:14,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:57:14,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:57:14,897 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:57:14,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:57:14,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:57:14,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:57:14,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:57:14,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:57:14,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:57:14,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:57:14,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:57:14,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:57:14,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:57:14,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:57:14,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:57:14,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:57:14,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:57:14,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:57:14,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:57:14,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:57:14,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:57:14,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:57:14,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:57:14,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:57:14,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:57:14,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:57:14,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:57:14,903 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 02f4d89ad8ae68bf7980f37a0875d8dc9742c5b53631541ef266f31c83f1917f [2024-11-16 18:57:15,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:57:15,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:57:15,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:57:15,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:57:15,151 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:57:15,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-62.i [2024-11-16 18:57:16,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:57:16,700 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:57:16,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-62.i [2024-11-16 18:57:16,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27551cb2d/ba3205a9abb740db96de5d7f4203d925/FLAG54793f7e4 [2024-11-16 18:57:16,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27551cb2d/ba3205a9abb740db96de5d7f4203d925 [2024-11-16 18:57:16,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:57:16,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:57:16,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:57:16,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:57:16,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:57:16,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:57:16" (1/1) ... [2024-11-16 18:57:16,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7901260f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:16, skipping insertion in model container [2024-11-16 18:57:16,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:57:16" (1/1) ... [2024-11-16 18:57:16,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:57:16,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-62.i[917,930] [2024-11-16 18:57:16,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:57:16,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:57:16,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-62.i[917,930] [2024-11-16 18:57:17,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:57:17,022 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:57:17,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17 WrapperNode [2024-11-16 18:57:17,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:57:17,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:57:17,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:57:17,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:57:17,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,068 INFO L138 Inliner]: procedures = 27, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 332 [2024-11-16 18:57:17,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:57:17,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:57:17,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:57:17,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:57:17,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,117 INFO L175 MemorySlicer]: Split 88 memory accesses to 2 slices as follows [2, 86]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 25 writes are split as follows [0, 25]. [2024-11-16 18:57:17,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,124 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:57:17,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:57:17,130 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:57:17,130 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:57:17,131 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:57:17,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:57:17,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:57:17,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:57:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:57:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-16 18:57:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-16 18:57:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 18:57:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 18:57:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 18:57:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 18:57:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:57:17,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:57:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:57:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 18:57:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:57:17,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:57:17,272 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:57:17,274 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:57:17,550 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~mem40#1;havoc property_#t~mem41#1;havoc property_#t~ite48#1;havoc property_#t~mem42#1;havoc property_#t~mem47#1;havoc property_#t~mem43#1;havoc property_#t~ite46#1;havoc property_#t~mem44#1;havoc property_#t~mem45#1;havoc property_#t~short49#1;havoc property_#t~mem50#1;havoc property_#t~mem51#1;havoc property_#t~ite59#1;havoc property_#t~mem52#1;havoc property_#t~ite58#1;havoc property_#t~mem53#1;havoc property_#t~mem54#1;havoc property_#t~ite57#1;havoc property_#t~mem56#1;havoc property_#t~mem55#1;havoc property_#t~short60#1;havoc property_#t~mem61#1;havoc property_#t~ite75#1;havoc property_#t~mem62#1;havoc property_#t~ite71#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite70#1;havoc property_#t~mem67#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~short76#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short82#1; [2024-11-16 18:57:17,587 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-11-16 18:57:17,591 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:57:17,604 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:57:17,604 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:57:17,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:17 BoogieIcfgContainer [2024-11-16 18:57:17,605 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:57:17,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:57:17,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:57:17,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:57:17,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:57:16" (1/3) ... [2024-11-16 18:57:17,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bff171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:57:17, skipping insertion in model container [2024-11-16 18:57:17,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (2/3) ... [2024-11-16 18:57:17,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bff171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:57:17, skipping insertion in model container [2024-11-16 18:57:17,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:17" (3/3) ... [2024-11-16 18:57:17,614 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-62.i [2024-11-16 18:57:17,627 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:57:17,627 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:57:17,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:57:17,684 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;@3bd088ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:57:17,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:57:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 65 states have (on average 1.4) internal successors, (91), 66 states have internal predecessors, (91), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:57:17,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-16 18:57:17,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:17,695 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:17,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:17,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash 769597166, now seen corresponding path program 1 times [2024-11-16 18:57:17,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:17,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832899495] [2024-11-16 18:57:17,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:17,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 18:57:17,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:17,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832899495] [2024-11-16 18:57:17,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832899495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:17,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:17,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:57:17,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527694468] [2024-11-16 18:57:17,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:18,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:57:18,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:57:18,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:57:18,023 INFO L87 Difference]: Start difference. First operand has 76 states, 65 states have (on average 1.4) internal successors, (91), 66 states have internal predecessors, (91), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 18:57:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:18,042 INFO L93 Difference]: Finished difference Result 144 states and 215 transitions. [2024-11-16 18:57:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:57:18,044 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2024-11-16 18:57:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:18,049 INFO L225 Difference]: With dead ends: 144 [2024-11-16 18:57:18,049 INFO L226 Difference]: Without dead ends: 71 [2024-11-16 18:57:18,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:57:18,054 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:18,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:57:18,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-16 18:57:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-16 18:57:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:57:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-11-16 18:57:18,083 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 75 [2024-11-16 18:57:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:18,084 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-11-16 18:57:18,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 18:57:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-11-16 18:57:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-16 18:57:18,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:18,087 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:18,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:57:18,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:18,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2130084342, now seen corresponding path program 1 times [2024-11-16 18:57:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:18,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275115682] [2024-11-16 18:57:18,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:18,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:18,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:18,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:18,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:18,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:18,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 18:57:18,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:18,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275115682] [2024-11-16 18:57:18,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275115682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:18,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:18,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:57:18,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101743119] [2024-11-16 18:57:18,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:18,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:57:18,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:18,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:57:18,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:57:18,435 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 18:57:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:18,474 INFO L93 Difference]: Finished difference Result 142 states and 199 transitions. [2024-11-16 18:57:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:57:18,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-11-16 18:57:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:18,475 INFO L225 Difference]: With dead ends: 142 [2024-11-16 18:57:18,476 INFO L226 Difference]: Without dead ends: 74 [2024-11-16 18:57:18,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:57:18,478 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:18,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 277 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:57:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-16 18:57:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-16 18:57:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:57:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2024-11-16 18:57:18,487 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 75 [2024-11-16 18:57:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:18,488 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2024-11-16 18:57:18,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 18:57:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-11-16 18:57:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-16 18:57:18,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:18,491 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:18,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:57:18,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:18,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash -422072619, now seen corresponding path program 1 times [2024-11-16 18:57:18,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:18,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874547732] [2024-11-16 18:57:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 18:57:19,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:19,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874547732] [2024-11-16 18:57:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874547732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:19,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:19,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:57:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556084938] [2024-11-16 18:57:19,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:19,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:57:19,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:19,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:57:19,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:57:19,063 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 18:57:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:19,263 INFO L93 Difference]: Finished difference Result 181 states and 250 transitions. [2024-11-16 18:57:19,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:57:19,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-11-16 18:57:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:19,267 INFO L225 Difference]: With dead ends: 181 [2024-11-16 18:57:19,267 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 18:57:19,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:57:19,268 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 137 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:19,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 270 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:57:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 18:57:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2024-11-16 18:57:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:57:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2024-11-16 18:57:19,275 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 75 [2024-11-16 18:57:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:19,276 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2024-11-16 18:57:19,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 18:57:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2024-11-16 18:57:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-16 18:57:19,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:19,277 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:19,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:57:19,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:19,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash 776924344, now seen corresponding path program 1 times [2024-11-16 18:57:19,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:19,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045996860] [2024-11-16 18:57:19,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:19,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 18:57:19,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:19,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045996860] [2024-11-16 18:57:19,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045996860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:19,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:19,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:57:19,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427478257] [2024-11-16 18:57:19,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:19,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:57:19,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:19,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:57:19,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:57:19,836 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 18:57:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:20,186 INFO L93 Difference]: Finished difference Result 150 states and 206 transitions. [2024-11-16 18:57:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:57:20,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2024-11-16 18:57:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:20,187 INFO L225 Difference]: With dead ends: 150 [2024-11-16 18:57:20,189 INFO L226 Difference]: Without dead ends: 78 [2024-11-16 18:57:20,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:57:20,190 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 254 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:20,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 139 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:57:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-16 18:57:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-16 18:57:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:57:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2024-11-16 18:57:20,215 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 77 [2024-11-16 18:57:20,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:20,216 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2024-11-16 18:57:20,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 18:57:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2024-11-16 18:57:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-16 18:57:20,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:20,217 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:20,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:57:20,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:20,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:20,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1172492265, now seen corresponding path program 1 times [2024-11-16 18:57:20,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:20,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648150498] [2024-11-16 18:57:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:20,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 18:57:20,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:20,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648150498] [2024-11-16 18:57:20,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648150498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:20,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:20,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:57:20,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666747551] [2024-11-16 18:57:20,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:20,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:57:20,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:20,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:57:20,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:57:20,549 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 18:57:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:20,825 INFO L93 Difference]: Finished difference Result 188 states and 258 transitions. [2024-11-16 18:57:20,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:57:20,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-11-16 18:57:20,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:20,826 INFO L225 Difference]: With dead ends: 188 [2024-11-16 18:57:20,827 INFO L226 Difference]: Without dead ends: 118 [2024-11-16 18:57:20,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:57:20,828 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 153 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:20,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 712 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:57:20,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-16 18:57:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 83. [2024-11-16 18:57:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:57:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2024-11-16 18:57:20,843 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 77 [2024-11-16 18:57:20,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:20,843 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2024-11-16 18:57:20,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 18:57:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2024-11-16 18:57:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 18:57:20,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:20,846 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:20,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:57:20,846 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:20,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:20,849 INFO L85 PathProgramCache]: Analyzing trace with hash -113144619, now seen corresponding path program 1 times [2024-11-16 18:57:20,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:20,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697957083] [2024-11-16 18:57:20,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:20,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:22,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:22,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:22,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:22,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:22,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 18:57:22,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:22,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697957083] [2024-11-16 18:57:22,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697957083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:22,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:22,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:57:22,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517986672] [2024-11-16 18:57:22,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:22,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:57:22,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:22,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:57:22,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:57:22,504 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-16 18:57:22,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:22,906 INFO L93 Difference]: Finished difference Result 201 states and 275 transitions. [2024-11-16 18:57:22,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:57:22,906 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 79 [2024-11-16 18:57:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:22,907 INFO L225 Difference]: With dead ends: 201 [2024-11-16 18:57:22,909 INFO L226 Difference]: Without dead ends: 121 [2024-11-16 18:57:22,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:57:22,910 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 254 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:22,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 314 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:57:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-16 18:57:22,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2024-11-16 18:57:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:57:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2024-11-16 18:57:22,926 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 79 [2024-11-16 18:57:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:22,927 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2024-11-16 18:57:22,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-16 18:57:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-16 18:57:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 18:57:22,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:22,930 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:22,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:57:22,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:22,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:22,931 INFO L85 PathProgramCache]: Analyzing trace with hash 12353850, now seen corresponding path program 1 times [2024-11-16 18:57:22,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:22,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314267565] [2024-11-16 18:57:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:22,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 18:57:23,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:23,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314267565] [2024-11-16 18:57:23,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314267565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:23,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:23,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:57:23,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436737968] [2024-11-16 18:57:23,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:23,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:57:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:23,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:57:23,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:57:23,289 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 18:57:23,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:23,543 INFO L93 Difference]: Finished difference Result 210 states and 285 transitions. [2024-11-16 18:57:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:57:23,543 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2024-11-16 18:57:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:23,545 INFO L225 Difference]: With dead ends: 210 [2024-11-16 18:57:23,545 INFO L226 Difference]: Without dead ends: 127 [2024-11-16 18:57:23,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:57:23,546 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 127 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:23,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 556 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:57:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-16 18:57:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 86. [2024-11-16 18:57:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:57:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2024-11-16 18:57:23,564 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 79 [2024-11-16 18:57:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:23,564 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2024-11-16 18:57:23,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 18:57:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-16 18:57:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 18:57:23,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:23,565 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:23,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:57:23,566 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:23,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash -187579750, now seen corresponding path program 1 times [2024-11-16 18:57:23,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:23,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960771989] [2024-11-16 18:57:23,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:23,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 18:57:24,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:24,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960771989] [2024-11-16 18:57:24,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960771989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:24,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:24,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:57:24,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079086336] [2024-11-16 18:57:24,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:24,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:57:24,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:24,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:57:24,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:57:24,726 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-16 18:57:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:25,128 INFO L93 Difference]: Finished difference Result 205 states and 277 transitions. [2024-11-16 18:57:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:57:25,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 79 [2024-11-16 18:57:25,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:25,130 INFO L225 Difference]: With dead ends: 205 [2024-11-16 18:57:25,130 INFO L226 Difference]: Without dead ends: 122 [2024-11-16 18:57:25,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:57:25,131 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 176 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:25,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 254 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:57:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-16 18:57:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2024-11-16 18:57:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:57:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2024-11-16 18:57:25,139 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 79 [2024-11-16 18:57:25,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:25,140 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2024-11-16 18:57:25,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-16 18:57:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2024-11-16 18:57:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 18:57:25,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:25,141 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:25,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:57:25,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:25,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:25,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1104120864, now seen corresponding path program 1 times [2024-11-16 18:57:25,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:25,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73414050] [2024-11-16 18:57:25,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:25,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:25,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:25,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:25,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:25,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:25,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:25,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 18:57:25,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:25,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73414050] [2024-11-16 18:57:25,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73414050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:25,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:25,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:57:25,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967621801] [2024-11-16 18:57:25,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:25,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:57:25,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:25,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:57:25,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:57:25,218 INFO L87 Difference]: Start difference. First operand 89 states and 120 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 18:57:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:25,238 INFO L93 Difference]: Finished difference Result 178 states and 241 transitions. [2024-11-16 18:57:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:57:25,239 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2024-11-16 18:57:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:25,240 INFO L225 Difference]: With dead ends: 178 [2024-11-16 18:57:25,240 INFO L226 Difference]: Without dead ends: 92 [2024-11-16 18:57:25,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:57:25,241 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:25,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:57:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-16 18:57:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-16 18:57:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:57:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2024-11-16 18:57:25,247 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 79 [2024-11-16 18:57:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:25,248 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2024-11-16 18:57:25,248 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 18:57:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2024-11-16 18:57:25,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 18:57:25,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:25,249 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:25,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:57:25,249 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:25,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash 138192504, now seen corresponding path program 1 times [2024-11-16 18:57:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:25,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679903125] [2024-11-16 18:57:25,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:25,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:26,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:26,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:26,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:26,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:26,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 18:57:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679903125] [2024-11-16 18:57:26,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679903125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:26,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:26,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:57:26,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852323663] [2024-11-16 18:57:26,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:26,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:57:26,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:26,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:57:26,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:57:26,209 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-16 18:57:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:26,576 INFO L93 Difference]: Finished difference Result 215 states and 286 transitions. [2024-11-16 18:57:26,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:57:26,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 81 [2024-11-16 18:57:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:26,577 INFO L225 Difference]: With dead ends: 215 [2024-11-16 18:57:26,577 INFO L226 Difference]: Without dead ends: 126 [2024-11-16 18:57:26,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:57:26,578 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 286 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:26,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 264 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:57:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-16 18:57:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 88. [2024-11-16 18:57:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 78 states have internal predecessors, (100), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:57:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2024-11-16 18:57:26,592 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 81 [2024-11-16 18:57:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:26,593 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2024-11-16 18:57:26,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-16 18:57:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2024-11-16 18:57:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 18:57:26,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:26,593 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:26,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:57:26,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:26,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:26,594 INFO L85 PathProgramCache]: Analyzing trace with hash -61741096, now seen corresponding path program 1 times [2024-11-16 18:57:26,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:26,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730481552] [2024-11-16 18:57:26,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:26,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:27,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:27,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:27,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:27,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:27,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:27,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:27,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:27,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 18:57:27,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:27,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730481552] [2024-11-16 18:57:27,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730481552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:27,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:27,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:57:27,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586757547] [2024-11-16 18:57:27,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:27,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:57:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:27,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:57:27,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:57:27,299 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 18:57:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:27,676 INFO L93 Difference]: Finished difference Result 226 states and 295 transitions. [2024-11-16 18:57:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:57:27,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2024-11-16 18:57:27,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:27,677 INFO L225 Difference]: With dead ends: 226 [2024-11-16 18:57:27,677 INFO L226 Difference]: Without dead ends: 141 [2024-11-16 18:57:27,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:57:27,678 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 231 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:27,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 337 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:57:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-16 18:57:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-11-16 18:57:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 124 states have (on average 1.2741935483870968) internal successors, (158), 125 states have internal predecessors, (158), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 18:57:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 178 transitions. [2024-11-16 18:57:27,693 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 178 transitions. Word has length 81 [2024-11-16 18:57:27,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:27,693 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 178 transitions. [2024-11-16 18:57:27,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 18:57:27,693 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2024-11-16 18:57:27,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 18:57:27,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:27,695 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:27,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:57:27,695 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:27,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash -572275273, now seen corresponding path program 1 times [2024-11-16 18:57:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:27,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872882234] [2024-11-16 18:57:27,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:29,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:29,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:29,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:29,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:29,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:29,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:29,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:29,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-16 18:57:29,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872882234] [2024-11-16 18:57:29,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872882234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:57:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183382359] [2024-11-16 18:57:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:29,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:57:29,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:57:29,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:57:29,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 18:57:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:29,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-16 18:57:29,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:57:30,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:57:30,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:57:30,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:57:31,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:57:31,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 49 [2024-11-16 18:57:31,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:31,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:31,305 INFO L349 Elim1Store]: treesize reduction 36, result has 20.0 percent of original size [2024-11-16 18:57:31,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 72 [2024-11-16 18:57:31,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:31,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:31,506 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-16 18:57:31,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 51 [2024-11-16 18:57:31,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:31,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2024-11-16 18:57:32,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 156 [2024-11-16 18:57:32,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:32,653 INFO L349 Elim1Store]: treesize reduction 301, result has 43.5 percent of original size [2024-11-16 18:57:32,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 42 case distinctions, treesize of input 159 treesize of output 378