./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_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 bb431c15a53fac0c4e22be07227ce83ff2546829e87bec0102c153438eba00d8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:49:23,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:49:23,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:49:23,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:49:23,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:49:23,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:49:23,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:49:23,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:49:23,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:49:23,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:49:23,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:49:23,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:49:23,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:49:23,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:49:23,942 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:49:23,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:49:23,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:49:23,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:49:23,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:49:23,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:49:23,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:49:23,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:49:23,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:49:23,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:49:23,947 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:49:23,947 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:49:23,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:49:23,947 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:49:23,947 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:49:23,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:49:23,948 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:49:23,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:49:23,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:49:23,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:49:23,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:49:23,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:49:23,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:49:23,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:49:23,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:49:23,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:49:23,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:49:23,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:49:23,951 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 -> bb431c15a53fac0c4e22be07227ce83ff2546829e87bec0102c153438eba00d8 [2024-11-10 09:49:24,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:49:24,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:49:24,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:49:24,174 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:49:24,175 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:49:24,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i [2024-11-10 09:49:25,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:49:25,745 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:49:25,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i [2024-11-10 09:49:25,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cbfbf6d0/173a196d74f14eb7babac2314acf1405/FLAG8bd65106e [2024-11-10 09:49:26,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cbfbf6d0/173a196d74f14eb7babac2314acf1405 [2024-11-10 09:49:26,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:49:26,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:49:26,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:49:26,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:49:26,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:49:26,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2765c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26, skipping insertion in model container [2024-11-10 09:49:26,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:49:26,330 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-s_file-62.i[916,929] [2024-11-10 09:49:26,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:49:26,380 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:49:26,396 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-s_file-62.i[916,929] [2024-11-10 09:49:26,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:49:26,454 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:49:26,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26 WrapperNode [2024-11-10 09:49:26,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:49:26,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:49:26,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:49:26,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:49:26,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,553 INFO L138 Inliner]: procedures = 27, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 322 [2024-11-10 09:49:26,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:49:26,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:49:26,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:49:26,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:49:26,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,595 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-10 09:49:26,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:49:26,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:49:26,623 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:49:26,623 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:49:26,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (1/1) ... [2024-11-10 09:49:26,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:49:26,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:49:26,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:49:26,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:49:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:49:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-10 09:49:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-10 09:49:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:49:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:49:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:49:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:49:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:49:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:49:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:49:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:49:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:49:26,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:49:26,823 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:49:26,825 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:49:27,112 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: 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-10 09:49:27,149 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-11-10 09:49:27,149 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:49:27,161 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:49:27,161 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:49:27,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:49:27 BoogieIcfgContainer [2024-11-10 09:49:27,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:49:27,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:49:27,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:49:27,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:49:27,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:49:26" (1/3) ... [2024-11-10 09:49:27,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5621f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:49:27, skipping insertion in model container [2024-11-10 09:49:27,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:49:26" (2/3) ... [2024-11-10 09:49:27,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5621f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:49:27, skipping insertion in model container [2024-11-10 09:49:27,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:49:27" (3/3) ... [2024-11-10 09:49:27,170 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-62.i [2024-11-10 09:49:27,184 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:49:27,185 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:49:27,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:49:27,242 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;@29b9f0c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:49:27,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:49:27,249 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-10 09:49:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 09:49:27,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:27,257 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-10 09:49:27,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:27,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:27,262 INFO L85 PathProgramCache]: Analyzing trace with hash 769597166, now seen corresponding path program 1 times [2024-11-10 09:49:27,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:27,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965918058] [2024-11-10 09:49:27,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:27,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,499 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-10 09:49:27,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:27,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965918058] [2024-11-10 09:49:27,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965918058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:27,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:27,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:49:27,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472296096] [2024-11-10 09:49:27,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:27,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:49:27,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:27,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:49:27,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:49:27,529 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-10 09:49:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:27,554 INFO L93 Difference]: Finished difference Result 144 states and 215 transitions. [2024-11-10 09:49:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:49:27,556 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-10 09:49:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:27,563 INFO L225 Difference]: With dead ends: 144 [2024-11-10 09:49:27,563 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 09:49:27,583 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-10 09:49:27,586 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-10 09:49:27,600 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-10 09:49:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 09:49:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-10 09:49:27,653 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-10 09:49:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-11-10 09:49:27,655 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 75 [2024-11-10 09:49:27,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:27,656 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-11-10 09:49:27,656 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-10 09:49:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-11-10 09:49:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 09:49:27,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:27,658 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-10 09:49:27,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:49:27,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:27,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2130084342, now seen corresponding path program 1 times [2024-11-10 09:49:27,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:27,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28570844] [2024-11-10 09:49:27,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:27,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:27,841 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-10 09:49:27,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28570844] [2024-11-10 09:49:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28570844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:49:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270895056] [2024-11-10 09:49:27,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:27,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:49:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:27,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:49:27,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:49:27,845 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-10 09:49:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:27,895 INFO L93 Difference]: Finished difference Result 142 states and 199 transitions. [2024-11-10 09:49:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:49:27,896 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-10 09:49:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:27,899 INFO L225 Difference]: With dead ends: 142 [2024-11-10 09:49:27,901 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 09:49:27,901 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-10 09:49:27,903 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-10 09:49:27,904 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-10 09:49:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 09:49:27,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-10 09:49:27,914 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-10 09:49:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2024-11-10 09:49:27,918 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 75 [2024-11-10 09:49:27,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:27,920 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2024-11-10 09:49:27,920 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-10 09:49:27,920 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-11-10 09:49:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 09:49:27,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:27,924 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-10 09:49:27,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:49:27,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:27,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:27,925 INFO L85 PathProgramCache]: Analyzing trace with hash -422072619, now seen corresponding path program 1 times [2024-11-10 09:49:27,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:27,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814627377] [2024-11-10 09:49:27,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:27,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,417 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-10 09:49:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:28,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814627377] [2024-11-10 09:49:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814627377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:28,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:28,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:49:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663926822] [2024-11-10 09:49:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:28,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:49:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:49:28,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:49:28,422 INFO L87 Difference]: Start difference. First operand 73 states and 101 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-10 09:49:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:28,576 INFO L93 Difference]: Finished difference Result 171 states and 237 transitions. [2024-11-10 09:49:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:49:28,577 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-10 09:49:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:28,579 INFO L225 Difference]: With dead ends: 171 [2024-11-10 09:49:28,579 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 09:49:28,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:49:28,582 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 81 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:28,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 201 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:49:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 09:49:28,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 73. [2024-11-10 09:49:28,593 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-10 09:49:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2024-11-10 09:49:28,594 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 75 [2024-11-10 09:49:28,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:28,594 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2024-11-10 09:49:28,594 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-10 09:49:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2024-11-10 09:49:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 09:49:28,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:28,596 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-10 09:49:28,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:49:28,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:28,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:28,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1172492265, now seen corresponding path program 1 times [2024-11-10 09:49:28,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:28,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308497189] [2024-11-10 09:49:28,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:28,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:28,907 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-10 09:49:28,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308497189] [2024-11-10 09:49:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308497189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:28,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:28,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:49:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103116241] [2024-11-10 09:49:28,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:28,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:49:28,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:28,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:49:28,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:49:28,914 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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-10 09:49:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:29,174 INFO L93 Difference]: Finished difference Result 216 states and 298 transitions. [2024-11-10 09:49:29,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:49:29,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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-10 09:49:29,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:29,176 INFO L225 Difference]: With dead ends: 216 [2024-11-10 09:49:29,178 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 09:49:29,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:49:29,179 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 82 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:29,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 626 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:49:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 09:49:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 83. [2024-11-10 09:49:29,191 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-10 09:49:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2024-11-10 09:49:29,192 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 77 [2024-11-10 09:49:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:29,192 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2024-11-10 09:49:29,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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-10 09:49:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2024-11-10 09:49:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 09:49:29,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:29,196 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-10 09:49:29,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:49:29,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:29,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:29,197 INFO L85 PathProgramCache]: Analyzing trace with hash -113144619, now seen corresponding path program 1 times [2024-11-10 09:49:29,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:29,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155816708] [2024-11-10 09:49:29,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:29,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:29,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:29,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:29,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:29,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:29,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:29,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:29,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:29,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:29,878 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-10 09:49:29,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155816708] [2024-11-10 09:49:29,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155816708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:29,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:49:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104270952] [2024-11-10 09:49:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:29,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:49:29,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:29,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:49:29,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:49:29,882 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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-10 09:49:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:30,104 INFO L93 Difference]: Finished difference Result 198 states and 271 transitions. [2024-11-10 09:49:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:49:30,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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 79 [2024-11-10 09:49:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:30,108 INFO L225 Difference]: With dead ends: 198 [2024-11-10 09:49:30,109 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 09:49:30,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:49:30,110 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 50 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:30,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 416 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:49:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 09:49:30,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 83. [2024-11-10 09:49:30,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 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-10 09:49:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2024-11-10 09:49:30,123 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 79 [2024-11-10 09:49:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:30,123 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2024-11-10 09:49:30,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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-10 09:49:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2024-11-10 09:49:30,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 09:49:30,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:30,125 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-10 09:49:30,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:49:30,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:30,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:30,125 INFO L85 PathProgramCache]: Analyzing trace with hash -187579750, now seen corresponding path program 1 times [2024-11-10 09:49:30,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:30,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581862147] [2024-11-10 09:49:30,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:30,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:30,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:30,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:30,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:30,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:30,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:30,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:30,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:30,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:30,735 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-10 09:49:30,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:30,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581862147] [2024-11-10 09:49:30,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581862147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:30,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:30,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:49:30,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511128580] [2024-11-10 09:49:30,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:30,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:49:30,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:30,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:49:30,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:49:30,739 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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-10 09:49:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:30,921 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2024-11-10 09:49:30,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:49:30,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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 79 [2024-11-10 09:49:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:30,924 INFO L225 Difference]: With dead ends: 193 [2024-11-10 09:49:30,924 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 09:49:30,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:49:30,926 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 47 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:30,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 291 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:49:30,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 09:49:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 83. [2024-11-10 09:49:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 73 states have internal predecessors, (96), 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-10 09:49:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2024-11-10 09:49:30,936 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 79 [2024-11-10 09:49:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:30,938 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2024-11-10 09:49:30,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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-10 09:49:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2024-11-10 09:49:30,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 09:49:30,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:30,939 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-10 09:49:30,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:49:30,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:30,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1104120864, now seen corresponding path program 1 times [2024-11-10 09:49:30,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:30,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012197103] [2024-11-10 09:49:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:30,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,067 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-10 09:49:31,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:31,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012197103] [2024-11-10 09:49:31,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012197103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:31,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:31,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:49:31,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733208406] [2024-11-10 09:49:31,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:31,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:49:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:49:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:49:31,070 INFO L87 Difference]: Start difference. First operand 83 states and 112 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-10 09:49:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:31,096 INFO L93 Difference]: Finished difference Result 166 states and 225 transitions. [2024-11-10 09:49:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:49:31,097 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-10 09:49:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:31,098 INFO L225 Difference]: With dead ends: 166 [2024-11-10 09:49:31,099 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 09:49:31,099 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-10 09:49:31,100 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-10 09:49:31,100 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-10 09:49:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 09:49:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 09:49:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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-10 09:49:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2024-11-10 09:49:31,110 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 79 [2024-11-10 09:49:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:31,111 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2024-11-10 09:49:31,111 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-10 09:49:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2024-11-10 09:49:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 09:49:31,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:31,112 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-10 09:49:31,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:49:31,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:31,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:31,115 INFO L85 PathProgramCache]: Analyzing trace with hash -61741096, now seen corresponding path program 1 times [2024-11-10 09:49:31,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:31,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92501421] [2024-11-10 09:49:31,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:31,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:31,490 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-10 09:49:31,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:31,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92501421] [2024-11-10 09:49:31,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92501421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:31,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:31,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:49:31,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601905242] [2024-11-10 09:49:31,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:31,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:49:31,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:31,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:49:31,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:49:31,509 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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-10 09:49:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:31,701 INFO L93 Difference]: Finished difference Result 223 states and 296 transitions. [2024-11-10 09:49:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:49:31,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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 81 [2024-11-10 09:49:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:31,703 INFO L225 Difference]: With dead ends: 223 [2024-11-10 09:49:31,703 INFO L226 Difference]: Without dead ends: 140 [2024-11-10 09:49:31,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:49:31,704 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 55 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:31,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 440 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:49:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-10 09:49:31,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2024-11-10 09:49:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 123 states have (on average 1.3008130081300813) internal successors, (160), 124 states have internal predecessors, (160), 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-10 09:49:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 180 transitions. [2024-11-10 09:49:31,711 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 180 transitions. Word has length 81 [2024-11-10 09:49:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:31,711 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 180 transitions. [2024-11-10 09:49:31,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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-10 09:49:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 180 transitions. [2024-11-10 09:49:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 09:49:31,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:31,712 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-10 09:49:31,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:49:31,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:31,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash -572275273, now seen corresponding path program 1 times [2024-11-10 09:49:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:31,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725130356] [2024-11-10 09:49:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:32,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:32,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:32,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:32,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:32,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:32,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:32,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:32,163 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-10 09:49:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725130356] [2024-11-10 09:49:32,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725130356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:49:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69191853] [2024-11-10 09:49:32,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:32,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:49:32,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:49:32,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:49:32,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:49:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:32,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 09:49:32,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:49:32,336 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 19 treesize of output 1 [2024-11-10 09:49:32,356 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 29 treesize of output 13 [2024-11-10 09:49:32,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 09:49:32,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:49:32,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-10 09:49:32,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:49:32,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2024-11-10 09:49:32,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:49:32,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-10 09:49:32,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:49:32,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2024-11-10 09:49:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 77 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-10 09:49:32,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:49:32,803 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-10 09:49:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69191853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:49:32,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:49:32,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-10 09:49:32,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227223001] [2024-11-10 09:49:32,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:49:32,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 09:49:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:32,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 09:49:32,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2024-11-10 09:49:32,807 INFO L87 Difference]: Start difference. First operand 136 states and 180 transitions. Second operand has 19 states, 16 states have (on average 5.3125) internal successors, (85), 19 states have internal predecessors, (85), 9 states have call successors, (20), 3 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 9 states have call successors, (20) [2024-11-10 09:49:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:33,111 INFO L93 Difference]: Finished difference Result 277 states and 364 transitions. [2024-11-10 09:49:33,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:49:33,112 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 5.3125) internal successors, (85), 19 states have internal predecessors, (85), 9 states have call successors, (20), 3 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 9 states have call successors, (20) Word has length 81 [2024-11-10 09:49:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:33,114 INFO L225 Difference]: With dead ends: 277 [2024-11-10 09:49:33,114 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 09:49:33,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2024-11-10 09:49:33,115 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 67 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:33,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 266 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:49:33,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 09:49:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2024-11-10 09:49:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 127 states have internal predecessors, (160), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 09:49:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 180 transitions. [2024-11-10 09:49:33,125 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 180 transitions. Word has length 81 [2024-11-10 09:49:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:33,125 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 180 transitions. [2024-11-10 09:49:33,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 5.3125) internal successors, (85), 19 states have internal predecessors, (85), 9 states have call successors, (20), 3 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 9 states have call successors, (20) [2024-11-10 09:49:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 180 transitions. [2024-11-10 09:49:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:49:33,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:33,128 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, 1] [2024-11-10 09:49:33,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:49:33,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:49:33,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:33,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:33,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1837091767, now seen corresponding path program 1 times [2024-11-10 09:49:33,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:33,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719190859] [2024-11-10 09:49:33,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:33,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:34,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:34,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:34,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:34,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:34,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:34,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:34,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:34,467 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-10 09:49:34,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:34,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719190859] [2024-11-10 09:49:34,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719190859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:34,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:34,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 09:49:34,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89202838] [2024-11-10 09:49:34,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:34,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 09:49:34,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:34,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 09:49:34,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-10 09:49:34,469 INFO L87 Difference]: Start difference. First operand 140 states and 180 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 09:49:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:35,620 INFO L93 Difference]: Finished difference Result 722 states and 918 transitions. [2024-11-10 09:49:35,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 09:49:35,621 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2024-11-10 09:49:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:35,623 INFO L225 Difference]: With dead ends: 722 [2024-11-10 09:49:35,623 INFO L226 Difference]: Without dead ends: 585 [2024-11-10 09:49:35,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=1087, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 09:49:35,624 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 557 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:35,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 989 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:49:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-10 09:49:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 321. [2024-11-10 09:49:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 294 states have (on average 1.2653061224489797) internal successors, (372), 296 states have internal predecessors, (372), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:49:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 412 transitions. [2024-11-10 09:49:35,642 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 412 transitions. Word has length 82 [2024-11-10 09:49:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:35,643 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 412 transitions. [2024-11-10 09:49:35,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 09:49:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 412 transitions. [2024-11-10 09:49:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:49:35,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:35,644 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, 1] [2024-11-10 09:49:35,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:49:35,644 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:35,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:35,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1880334599, now seen corresponding path program 1 times [2024-11-10 09:49:35,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:35,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226670424] [2024-11-10 09:49:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:36,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:36,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:36,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:36,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:36,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:36,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:36,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:36,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-10 09:49:36,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:36,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226670424] [2024-11-10 09:49:36,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226670424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:49:36,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142500327] [2024-11-10 09:49:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:36,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:49:36,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:49:36,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:49:36,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 09:49:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:36,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 09:49:36,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:49:36,536 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 89 treesize of output 55 [2024-11-10 09:49:36,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:49:36,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 70 [2024-11-10 09:49:36,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:49:36,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 45 [2024-11-10 09:49:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-10 09:49:36,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:49:37,016 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-10 09:49:37,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142500327] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:49:37,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:49:37,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 23 [2024-11-10 09:49:37,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793860978] [2024-11-10 09:49:37,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:37,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:49:37,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:37,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:49:37,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:49:37,018 INFO L87 Difference]: Start difference. First operand 321 states and 412 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-10 09:49:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:37,455 INFO L93 Difference]: Finished difference Result 816 states and 1047 transitions. [2024-11-10 09:49:37,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:49:37,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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 82 [2024-11-10 09:49:37,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:37,457 INFO L225 Difference]: With dead ends: 816 [2024-11-10 09:49:37,457 INFO L226 Difference]: Without dead ends: 498 [2024-11-10 09:49:37,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2024-11-10 09:49:37,459 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 60 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:37,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 729 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:49:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-10 09:49:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 300. [2024-11-10 09:49:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 273 states have (on average 1.2637362637362637) internal successors, (345), 275 states have internal predecessors, (345), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:49:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 385 transitions. [2024-11-10 09:49:37,471 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 385 transitions. Word has length 82 [2024-11-10 09:49:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:37,471 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 385 transitions. [2024-11-10 09:49:37,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-10 09:49:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 385 transitions. [2024-11-10 09:49:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:49:37,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:37,472 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, 1] [2024-11-10 09:49:37,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 09:49:37,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 09:49:37,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:37,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1904098520, now seen corresponding path program 1 times [2024-11-10 09:49:37,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:37,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295225536] [2024-11-10 09:49:37,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:37,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:37,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:37,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:37,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:37,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:37,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:37,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:37,919 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-10 09:49:37,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:37,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295225536] [2024-11-10 09:49:37,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295225536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:37,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:37,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:49:37,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124481606] [2024-11-10 09:49:37,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:37,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:49:37,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:37,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:49:37,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:49:37,921 INFO L87 Difference]: Start difference. First operand 300 states and 385 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-10 09:49:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:38,083 INFO L93 Difference]: Finished difference Result 684 states and 875 transitions. [2024-11-10 09:49:38,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:49:38,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 82 [2024-11-10 09:49:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:38,085 INFO L225 Difference]: With dead ends: 684 [2024-11-10 09:49:38,085 INFO L226 Difference]: Without dead ends: 387 [2024-11-10 09:49:38,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:49:38,086 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 54 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:38,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 424 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:49:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-10 09:49:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 300. [2024-11-10 09:49:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 273 states have (on average 1.2564102564102564) internal successors, (343), 275 states have internal predecessors, (343), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:49:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 383 transitions. [2024-11-10 09:49:38,097 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 383 transitions. Word has length 82 [2024-11-10 09:49:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:38,098 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 383 transitions. [2024-11-10 09:49:38,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-10 09:49:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 383 transitions. [2024-11-10 09:49:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:49:38,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:38,099 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, 1] [2024-11-10 09:49:38,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:49:38,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:38,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:38,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1531666230, now seen corresponding path program 1 times [2024-11-10 09:49:38,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:38,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839362387] [2024-11-10 09:49:38,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:38,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,181 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-10 09:49:38,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:38,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839362387] [2024-11-10 09:49:38,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839362387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:38,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:38,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:49:38,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780587750] [2024-11-10 09:49:38,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:38,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:49:38,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:38,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:49:38,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:49:38,183 INFO L87 Difference]: Start difference. First operand 300 states and 383 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-10 09:49:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:38,211 INFO L93 Difference]: Finished difference Result 613 states and 783 transitions. [2024-11-10 09:49:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:49:38,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 82 [2024-11-10 09:49:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:38,213 INFO L225 Difference]: With dead ends: 613 [2024-11-10 09:49:38,213 INFO L226 Difference]: Without dead ends: 316 [2024-11-10 09:49:38,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:49:38,214 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:38,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 444 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:49:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-10 09:49:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 304. [2024-11-10 09:49:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 277 states have (on average 1.2527075812274369) internal successors, (347), 279 states have internal predecessors, (347), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:49:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 387 transitions. [2024-11-10 09:49:38,225 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 387 transitions. Word has length 82 [2024-11-10 09:49:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:38,226 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 387 transitions. [2024-11-10 09:49:38,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-10 09:49:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 387 transitions. [2024-11-10 09:49:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:49:38,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:38,227 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, 1] [2024-11-10 09:49:38,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:49:38,227 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:38,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:38,227 INFO L85 PathProgramCache]: Analyzing trace with hash -999595450, now seen corresponding path program 1 times [2024-11-10 09:49:38,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:38,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639255252] [2024-11-10 09:49:38,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:38,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:38,303 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-10 09:49:38,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:38,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639255252] [2024-11-10 09:49:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639255252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:38,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:38,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:49:38,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688560183] [2024-11-10 09:49:38,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:38,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:49:38,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:38,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:49:38,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:49:38,305 INFO L87 Difference]: Start difference. First operand 304 states and 387 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-10 09:49:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:38,399 INFO L93 Difference]: Finished difference Result 613 states and 777 transitions. [2024-11-10 09:49:38,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:49:38,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 82 [2024-11-10 09:49:38,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:38,401 INFO L225 Difference]: With dead ends: 613 [2024-11-10 09:49:38,401 INFO L226 Difference]: Without dead ends: 312 [2024-11-10 09:49:38,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:49:38,402 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 53 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:38,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 200 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:49:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-10 09:49:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 220. [2024-11-10 09:49:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 197 states have (on average 1.233502538071066) internal successors, (243), 197 states have internal predecessors, (243), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:49:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 275 transitions. [2024-11-10 09:49:38,412 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 275 transitions. Word has length 82 [2024-11-10 09:49:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:38,413 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 275 transitions. [2024-11-10 09:49:38,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-10 09:49:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 275 transitions. [2024-11-10 09:49:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 09:49:38,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:38,413 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, 1, 1] [2024-11-10 09:49:38,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:49:38,414 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:38,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1385291705, now seen corresponding path program 1 times [2024-11-10 09:49:38,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:38,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87138137] [2024-11-10 09:49:38,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:38,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:39,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:39,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:39,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:39,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:39,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:39,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:39,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:39,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-10 09:49:39,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:39,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87138137] [2024-11-10 09:49:39,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87138137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:49:39,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121280828] [2024-11-10 09:49:39,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:39,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:49:39,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:49:39,428 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:49:39,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 09:49:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:39,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 09:49:39,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:49:39,535 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 19 treesize of output 1 [2024-11-10 09:49:39,538 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 26 treesize of output 1 [2024-11-10 09:49:39,561 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 81 treesize of output 47 [2024-11-10 09:49:39,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:49:39,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 62 [2024-11-10 09:49:39,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:49:39,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 35 [2024-11-10 09:49:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-10 09:49:39,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:49:40,036 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-10 09:49:40,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121280828] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:49:40,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:49:40,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [24, 12] total 32 [2024-11-10 09:49:40,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234626750] [2024-11-10 09:49:40,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:40,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:49:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:40,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:49:40,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2024-11-10 09:49:40,038 INFO L87 Difference]: Start difference. First operand 220 states and 275 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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-10 09:49:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:40,430 INFO L93 Difference]: Finished difference Result 526 states and 655 transitions. [2024-11-10 09:49:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:49:40,430 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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 83 [2024-11-10 09:49:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:40,432 INFO L225 Difference]: With dead ends: 526 [2024-11-10 09:49:40,432 INFO L226 Difference]: Without dead ends: 309 [2024-11-10 09:49:40,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 09:49:40,433 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 52 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:40,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 773 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:49:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-10 09:49:40,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 101. [2024-11-10 09:49:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 89 states have internal predecessors, (109), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:49:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2024-11-10 09:49:40,440 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 83 [2024-11-10 09:49:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:40,440 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2024-11-10 09:49:40,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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-10 09:49:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2024-11-10 09:49:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-10 09:49:40,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:40,441 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, 1, 1, 1] [2024-11-10 09:49:40,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 09:49:40,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:49:40,646 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:40,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1113036152, now seen corresponding path program 1 times [2024-11-10 09:49:40,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:40,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137516596] [2024-11-10 09:49:40,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:40,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:40,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:40,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:40,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:40,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:40,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:40,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:40,742 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-10 09:49:40,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:40,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137516596] [2024-11-10 09:49:40,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137516596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:40,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:40,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:49:40,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966626999] [2024-11-10 09:49:40,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:40,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:49:40,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:40,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:49:40,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:49:40,744 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-10 09:49:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:40,853 INFO L93 Difference]: Finished difference Result 248 states and 304 transitions. [2024-11-10 09:49:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:49:40,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 84 [2024-11-10 09:49:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:40,854 INFO L225 Difference]: With dead ends: 248 [2024-11-10 09:49:40,854 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 09:49:40,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:49:40,855 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 43 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:40,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 339 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:49:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 09:49:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 101. [2024-11-10 09:49:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 89 states have internal predecessors, (108), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:49:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2024-11-10 09:49:40,862 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 84 [2024-11-10 09:49:40,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:40,862 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2024-11-10 09:49:40,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-10 09:49:40,862 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2024-11-10 09:49:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 09:49:40,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:40,863 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, 1, 1, 1, 1] [2024-11-10 09:49:40,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 09:49:40,863 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:40,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash 353588639, now seen corresponding path program 1 times [2024-11-10 09:49:40,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:40,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579379059] [2024-11-10 09:49:40,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:40,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,267 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-10 09:49:41,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:41,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579379059] [2024-11-10 09:49:41,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579379059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:41,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:41,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 09:49:41,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637285997] [2024-11-10 09:49:41,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:41,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 09:49:41,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 09:49:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:49:41,269 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 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-10 09:49:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:41,502 INFO L93 Difference]: Finished difference Result 267 states and 324 transitions. [2024-11-10 09:49:41,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 09:49:41,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 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 85 [2024-11-10 09:49:41,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:41,503 INFO L225 Difference]: With dead ends: 267 [2024-11-10 09:49:41,503 INFO L226 Difference]: Without dead ends: 169 [2024-11-10 09:49:41,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-10 09:49:41,504 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 51 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:41,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 673 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:49:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-10 09:49:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2024-11-10 09:49:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 140 states have internal predecessors, (166), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:49:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 190 transitions. [2024-11-10 09:49:41,515 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 190 transitions. Word has length 85 [2024-11-10 09:49:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:41,515 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 190 transitions. [2024-11-10 09:49:41,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 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-10 09:49:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 190 transitions. [2024-11-10 09:49:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 09:49:41,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:41,516 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, 1, 1, 1, 1] [2024-11-10 09:49:41,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 09:49:41,516 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:41,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:41,517 INFO L85 PathProgramCache]: Analyzing trace with hash -643162553, now seen corresponding path program 1 times [2024-11-10 09:49:41,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:41,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809880596] [2024-11-10 09:49:41,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,635 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-10 09:49:41,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:41,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809880596] [2024-11-10 09:49:41,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809880596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:41,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:41,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:49:41,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972229013] [2024-11-10 09:49:41,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:41,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:49:41,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:41,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:49:41,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:49:41,638 INFO L87 Difference]: Start difference. First operand 157 states and 190 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10 09:49:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:41,736 INFO L93 Difference]: Finished difference Result 342 states and 413 transitions. [2024-11-10 09:49:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:49:41,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 85 [2024-11-10 09:49:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:41,738 INFO L225 Difference]: With dead ends: 342 [2024-11-10 09:49:41,738 INFO L226 Difference]: Without dead ends: 188 [2024-11-10 09:49:41,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:49:41,739 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 52 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:41,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 280 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:49:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-10 09:49:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2024-11-10 09:49:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 160 states have (on average 1.16875) internal successors, (187), 162 states have internal predecessors, (187), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:49:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 223 transitions. [2024-11-10 09:49:41,753 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 223 transitions. Word has length 85 [2024-11-10 09:49:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:41,754 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 223 transitions. [2024-11-10 09:49:41,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10 09:49:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2024-11-10 09:49:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 09:49:41,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:41,755 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, 1, 1, 1, 1] [2024-11-10 09:49:41,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 09:49:41,755 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:41,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:41,755 INFO L85 PathProgramCache]: Analyzing trace with hash -671791704, now seen corresponding path program 1 times [2024-11-10 09:49:41,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:41,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266130469] [2024-11-10 09:49:41,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:41,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:41,860 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-10 09:49:41,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:41,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266130469] [2024-11-10 09:49:41,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266130469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:41,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:41,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:49:41,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976987688] [2024-11-10 09:49:41,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:41,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:49:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:41,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:49:41,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:49:41,862 INFO L87 Difference]: Start difference. First operand 187 states and 223 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10 09:49:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:41,965 INFO L93 Difference]: Finished difference Result 419 states and 503 transitions. [2024-11-10 09:49:41,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:49:41,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 85 [2024-11-10 09:49:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:41,968 INFO L225 Difference]: With dead ends: 419 [2024-11-10 09:49:41,968 INFO L226 Difference]: Without dead ends: 257 [2024-11-10 09:49:41,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:49:41,969 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 36 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:41,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 246 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:49:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-10 09:49:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 197. [2024-11-10 09:49:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 170 states have (on average 1.1588235294117648) internal successors, (197), 172 states have internal predecessors, (197), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:49:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 233 transitions. [2024-11-10 09:49:41,985 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 233 transitions. Word has length 85 [2024-11-10 09:49:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:41,986 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 233 transitions. [2024-11-10 09:49:41,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10 09:49:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 233 transitions. [2024-11-10 09:49:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 09:49:41,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:41,987 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, 1, 1, 1, 1] [2024-11-10 09:49:41,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 09:49:41,987 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:41,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash 286581886, now seen corresponding path program 1 times [2024-11-10 09:49:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:41,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869141564] [2024-11-10 09:49:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,044 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-10 09:49:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869141564] [2024-11-10 09:49:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869141564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:42,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:42,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:49:42,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034765470] [2024-11-10 09:49:42,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:42,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:49:42,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:42,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:49:42,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:49:42,046 INFO L87 Difference]: Start difference. First operand 197 states and 233 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10 09:49:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:42,166 INFO L93 Difference]: Finished difference Result 419 states and 495 transitions. [2024-11-10 09:49:42,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:49:42,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 85 [2024-11-10 09:49:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:42,168 INFO L225 Difference]: With dead ends: 419 [2024-11-10 09:49:42,168 INFO L226 Difference]: Without dead ends: 247 [2024-11-10 09:49:42,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:49:42,169 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 44 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:42,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 360 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:49:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-10 09:49:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2024-11-10 09:49:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 185 states have (on average 1.1513513513513514) internal successors, (213), 187 states have internal predecessors, (213), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:49:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 249 transitions. [2024-11-10 09:49:42,195 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 249 transitions. Word has length 85 [2024-11-10 09:49:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:42,196 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 249 transitions. [2024-11-10 09:49:42,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10 09:49:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 249 transitions. [2024-11-10 09:49:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 09:49:42,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:42,197 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, 1, 1, 1, 1, 1, 1] [2024-11-10 09:49:42,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 09:49:42,197 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:42,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1826457002, now seen corresponding path program 1 times [2024-11-10 09:49:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:42,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092040491] [2024-11-10 09:49:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:42,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:42,793 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-10 09:49:42,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:42,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092040491] [2024-11-10 09:49:42,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092040491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:42,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:42,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:49:42,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011497867] [2024-11-10 09:49:42,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:42,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:49:42,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:42,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:49:42,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:49:42,795 INFO L87 Difference]: Start difference. First operand 212 states and 249 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-10 09:49:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:43,023 INFO L93 Difference]: Finished difference Result 238 states and 279 transitions. [2024-11-10 09:49:43,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:49:43,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 87 [2024-11-10 09:49:43,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:43,024 INFO L225 Difference]: With dead ends: 238 [2024-11-10 09:49:43,025 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 09:49:43,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:49:43,025 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 61 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:43,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 359 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:49:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 09:49:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 230. [2024-11-10 09:49:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 199 states have (on average 1.1407035175879396) internal successors, (227), 201 states have internal predecessors, (227), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:49:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 267 transitions. [2024-11-10 09:49:43,054 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 267 transitions. Word has length 87 [2024-11-10 09:49:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:43,055 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 267 transitions. [2024-11-10 09:49:43,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-10 09:49:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 267 transitions. [2024-11-10 09:49:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 09:49:43,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:43,059 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, 1, 1, 1, 1, 1, 1] [2024-11-10 09:49:43,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 09:49:43,059 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:43,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:43,059 INFO L85 PathProgramCache]: Analyzing trace with hash -697070808, now seen corresponding path program 1 times [2024-11-10 09:49:43,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:43,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989186000] [2024-11-10 09:49:43,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:43,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:43,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:43,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:43,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:43,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:43,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:43,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:43,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:43,686 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-10 09:49:43,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:43,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989186000] [2024-11-10 09:49:43,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989186000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:43,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:43,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:49:43,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76466141] [2024-11-10 09:49:43,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:43,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:49:43,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:49:43,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:49:43,688 INFO L87 Difference]: Start difference. First operand 230 states and 267 transitions. Second operand has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 09:49:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:43,976 INFO L93 Difference]: Finished difference Result 572 states and 667 transitions. [2024-11-10 09:49:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:49:43,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2024-11-10 09:49:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:43,979 INFO L225 Difference]: With dead ends: 572 [2024-11-10 09:49:43,979 INFO L226 Difference]: Without dead ends: 379 [2024-11-10 09:49:43,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:49:43,979 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:43,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 459 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:49:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-10 09:49:43,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 331. [2024-11-10 09:49:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 300 states have (on average 1.1433333333333333) internal successors, (343), 302 states have internal predecessors, (343), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:49:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 383 transitions. [2024-11-10 09:49:43,996 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 383 transitions. Word has length 87 [2024-11-10 09:49:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:43,996 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 383 transitions. [2024-11-10 09:49:43,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 09:49:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 383 transitions. [2024-11-10 09:49:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 09:49:43,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:43,997 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:49:43,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 09:49:43,998 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:43,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:43,998 INFO L85 PathProgramCache]: Analyzing trace with hash 86117980, now seen corresponding path program 1 times [2024-11-10 09:49:43,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:43,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044840107] [2024-11-10 09:49:43,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:43,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,089 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-10 09:49:44,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:44,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044840107] [2024-11-10 09:49:44,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044840107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:44,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:44,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:49:44,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070728769] [2024-11-10 09:49:44,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:44,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:49:44,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:44,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:49:44,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:49:44,091 INFO L87 Difference]: Start difference. First operand 331 states and 383 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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-10 09:49:44,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:44,205 INFO L93 Difference]: Finished difference Result 648 states and 750 transitions. [2024-11-10 09:49:44,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:49:44,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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 88 [2024-11-10 09:49:44,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:44,207 INFO L225 Difference]: With dead ends: 648 [2024-11-10 09:49:44,207 INFO L226 Difference]: Without dead ends: 354 [2024-11-10 09:49:44,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:49:44,208 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 31 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:44,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 322 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:49:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-10 09:49:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 317. [2024-11-10 09:49:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 286 states have (on average 1.1293706293706294) internal successors, (323), 288 states have internal predecessors, (323), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:49:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 363 transitions. [2024-11-10 09:49:44,224 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 363 transitions. Word has length 88 [2024-11-10 09:49:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:44,225 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 363 transitions. [2024-11-10 09:49:44,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (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-10 09:49:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 363 transitions. [2024-11-10 09:49:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 09:49:44,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:44,226 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:49:44,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 09:49:44,226 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:44,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:44,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1501142325, now seen corresponding path program 1 times [2024-11-10 09:49:44,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:44,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821953029] [2024-11-10 09:49:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:44,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,285 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-10 09:49:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:44,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821953029] [2024-11-10 09:49:44,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821953029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:44,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:49:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581228404] [2024-11-10 09:49:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:44,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:49:44,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:44,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:49:44,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:49:44,287 INFO L87 Difference]: Start difference. First operand 317 states and 363 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-10 09:49:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:44,345 INFO L93 Difference]: Finished difference Result 507 states and 582 transitions. [2024-11-10 09:49:44,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:49:44,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 89 [2024-11-10 09:49:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:44,347 INFO L225 Difference]: With dead ends: 507 [2024-11-10 09:49:44,347 INFO L226 Difference]: Without dead ends: 227 [2024-11-10 09:49:44,348 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-10 09:49:44,348 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:44,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:49:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-10 09:49:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-10 09:49:44,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 196 states have (on average 1.1173469387755102) internal successors, (219), 198 states have internal predecessors, (219), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:49:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 259 transitions. [2024-11-10 09:49:44,363 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 259 transitions. Word has length 89 [2024-11-10 09:49:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:44,363 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 259 transitions. [2024-11-10 09:49:44,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-10 09:49:44,364 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 259 transitions. [2024-11-10 09:49:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 09:49:44,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:44,364 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:49:44,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 09:49:44,364 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:44,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:44,365 INFO L85 PathProgramCache]: Analyzing trace with hash -689076026, now seen corresponding path program 1 times [2024-11-10 09:49:44,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:44,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886617552] [2024-11-10 09:49:44,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:44,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:49:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:49:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:49:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:49:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:49:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:49:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:49:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:49:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:49:44,688 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-10 09:49:44,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:49:44,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886617552] [2024-11-10 09:49:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886617552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:49:44,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:49:44,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:49:44,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363195198] [2024-11-10 09:49:44,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:49:44,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:49:44,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:49:44,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:49:44,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:49:44,693 INFO L87 Difference]: Start difference. First operand 227 states and 259 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 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-10 09:49:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:49:44,873 INFO L93 Difference]: Finished difference Result 528 states and 600 transitions. [2024-11-10 09:49:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:49:44,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 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 89 [2024-11-10 09:49:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:49:44,875 INFO L225 Difference]: With dead ends: 528 [2024-11-10 09:49:44,875 INFO L226 Difference]: Without dead ends: 338 [2024-11-10 09:49:44,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:49:44,876 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 25 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:49:44,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 298 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:49:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-10 09:49:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 316. [2024-11-10 09:49:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 285 states have (on average 1.1157894736842104) internal successors, (318), 287 states have internal predecessors, (318), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:49:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 358 transitions. [2024-11-10 09:49:44,894 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 358 transitions. Word has length 89 [2024-11-10 09:49:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:49:44,894 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 358 transitions. [2024-11-10 09:49:44,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 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-10 09:49:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 358 transitions. [2024-11-10 09:49:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 09:49:44,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:49:44,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:49:44,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 09:49:44,896 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:49:44,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:49:44,896 INFO L85 PathProgramCache]: Analyzing trace with hash -522236284, now seen corresponding path program 1 times [2024-11-10 09:49:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:49:44,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747942267] [2024-11-10 09:49:44,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:49:44,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:49:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat