./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.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-sp_file-42.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 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:57:38,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:57:38,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:57:38,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:57:38,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:57:38,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:57:38,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:57:38,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:57:38,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:57:38,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:57:38,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:57:38,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:57:38,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:57:38,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:57:38,227 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:57:38,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:57:38,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:57:38,228 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:57:38,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:57:38,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:57:38,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:57:38,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:57:38,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:57:38,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:57:38,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:57:38,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:57:38,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:57:38,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:57:38,234 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:57:38,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:57:38,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:57:38,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:57:38,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:57:38,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:57:38,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:57:38,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:57:38,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:57:38,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:57:38,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:57:38,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:57:38,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:57:38,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:57:38,239 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 -> 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01 [2024-11-10 09:57:38,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:57:38,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:57:38,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:57:38,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:57:38,496 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:57:38,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i [2024-11-10 09:57:39,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:57:40,205 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:57:40,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i [2024-11-10 09:57:40,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5a9e5fe/8bb9944daa474789a4ce3ed8e14e03d6/FLAG07c353b4d [2024-11-10 09:57:40,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5a9e5fe/8bb9944daa474789a4ce3ed8e14e03d6 [2024-11-10 09:57:40,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:57:40,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:57:40,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:57:40,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:57:40,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:57:40,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:57:40" (1/1) ... [2024-11-10 09:57:40,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@484aae95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40, skipping insertion in model container [2024-11-10 09:57:40,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:57:40" (1/1) ... [2024-11-10 09:57:40,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:57:40,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i[917,930] [2024-11-10 09:57:40,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:57:40,605 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:57:40,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i[917,930] [2024-11-10 09:57:40,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:57:40,698 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:57:40,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40 WrapperNode [2024-11-10 09:57:40,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:57:40,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:57:40,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:57:40,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:57:40,708 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:57:40" (1/1) ... [2024-11-10 09:57:40,729 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:57:40" (1/1) ... [2024-11-10 09:57:40,770 INFO L138 Inliner]: procedures = 30, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446 [2024-11-10 09:57:40,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:57:40,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:57:40,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:57:40,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:57:40,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40" (1/1) ... [2024-11-10 09:57:40,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40" (1/1) ... [2024-11-10 09:57:40,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40" (1/1) ... [2024-11-10 09:57:40,795 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 09:57:40,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40" (1/1) ... [2024-11-10 09:57:40,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40" (1/1) ... [2024-11-10 09:57:40,811 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40" (1/1) ... [2024-11-10 09:57:40,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40" (1/1) ... [2024-11-10 09:57:40,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40" (1/1) ... [2024-11-10 09:57:40,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40" (1/1) ... [2024-11-10 09:57:40,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:57:40,826 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:57:40,826 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:57:40,826 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:57:40,828 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40" (1/1) ... [2024-11-10 09:57:40,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:57:40,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:57:40,874 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:57:40,880 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:57:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:57:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 09:57:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 09:57:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 09:57:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 09:57:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 09:57:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 09:57:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:57:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:57:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 09:57:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:57:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:57:41,070 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:57:41,072 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:57:41,637 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2024-11-10 09:57:41,688 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-10 09:57:41,689 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:57:41,728 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:57:41,732 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:57:41,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:57:41 BoogieIcfgContainer [2024-11-10 09:57:41,733 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:57:41,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:57:41,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:57:41,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:57:41,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:57:40" (1/3) ... [2024-11-10 09:57:41,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4ba949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:57:41, skipping insertion in model container [2024-11-10 09:57:41,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:40" (2/3) ... [2024-11-10 09:57:41,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4ba949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:57:41, skipping insertion in model container [2024-11-10 09:57:41,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:57:41" (3/3) ... [2024-11-10 09:57:41,750 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-42.i [2024-11-10 09:57:41,775 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:57:41,776 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:57:41,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:57:41,868 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;@2c05609b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:57:41,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:57:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 89 states have (on average 1.404494382022472) internal successors, (125), 90 states have internal predecessors, (125), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 09:57:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:57:41,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:41,884 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:41,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:41,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1235629030, now seen corresponding path program 1 times [2024-11-10 09:57:41,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:41,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690021357] [2024-11-10 09:57:41,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:41,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:42,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:42,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:42,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:57:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:42,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:57:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:42,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:57:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:57:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:42,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:57:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:42,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:57:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:42,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:42,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:57:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:42,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:57:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:57:42,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:42,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690021357] [2024-11-10 09:57:42,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690021357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:42,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:42,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:57:42,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525485525] [2024-11-10 09:57:42,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:42,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:57:42,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:57:42,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:57:42,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:57:42,399 INFO L87 Difference]: Start difference. First operand has 103 states, 89 states have (on average 1.404494382022472) internal successors, (125), 90 states have internal predecessors, (125), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 09:57:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:42,424 INFO L93 Difference]: Finished difference Result 198 states and 298 transitions. [2024-11-10 09:57:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:57:42,427 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-11-10 09:57:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:42,434 INFO L225 Difference]: With dead ends: 198 [2024-11-10 09:57:42,435 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 09:57:42,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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:57:42,443 INFO L432 NwaCegarLoop]: 137 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, 137 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:57:42,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:57:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 09:57:42,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 09:57:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 09:57:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2024-11-10 09:57:42,488 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 105 [2024-11-10 09:57:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:42,489 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2024-11-10 09:57:42,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 09:57:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2024-11-10 09:57:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:57:42,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:42,496 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:42,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:57:42,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:42,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash -591365901, now seen corresponding path program 1 times [2024-11-10 09:57:42,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:42,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242588849] [2024-11-10 09:57:42,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:42,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:57:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:57:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:57:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:57:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:57:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:57:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:57:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:57:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:57:43,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:43,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242588849] [2024-11-10 09:57:43,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242588849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:43,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:43,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:57:43,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226328887] [2024-11-10 09:57:43,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:43,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:57:43,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:57:43,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:57:43,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:57:43,261 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 09:57:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:43,461 INFO L93 Difference]: Finished difference Result 193 states and 271 transitions. [2024-11-10 09:57:43,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:57:43,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-10 09:57:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:43,468 INFO L225 Difference]: With dead ends: 193 [2024-11-10 09:57:43,468 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 09:57:43,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:57:43,470 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:43,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:57:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 09:57:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 09:57:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 09:57:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-11-10 09:57:43,485 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 105 [2024-11-10 09:57:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:43,487 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-11-10 09:57:43,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 09:57:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-11-10 09:57:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:57:43,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:43,490 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:43,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:57:43,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:43,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:43,491 INFO L85 PathProgramCache]: Analyzing trace with hash 916185908, now seen corresponding path program 1 times [2024-11-10 09:57:43,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:43,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21560163] [2024-11-10 09:57:43,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:43,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:57:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:57:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:57:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:57:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:57:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:57:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:57:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:57:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:57:43,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:43,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21560163] [2024-11-10 09:57:43,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21560163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:43,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:43,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:57:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147766673] [2024-11-10 09:57:43,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:43,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:57:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:57:43,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:57:43,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:57:43,844 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 09:57:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:43,863 INFO L93 Difference]: Finished difference Result 191 states and 266 transitions. [2024-11-10 09:57:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:57:43,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-10 09:57:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:43,865 INFO L225 Difference]: With dead ends: 191 [2024-11-10 09:57:43,867 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 09:57:43,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:57:43,870 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:43,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:57:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 09:57:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 09:57:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 09:57:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2024-11-10 09:57:43,887 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 105 [2024-11-10 09:57:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:43,887 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2024-11-10 09:57:43,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 09:57:43,888 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2024-11-10 09:57:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:57:43,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:43,889 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:43,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:57:43,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:43,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:43,890 INFO L85 PathProgramCache]: Analyzing trace with hash 872851128, now seen corresponding path program 1 times [2024-11-10 09:57:43,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:43,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058374736] [2024-11-10 09:57:43,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:43,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:57:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:57:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:57:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:57:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:57:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:57:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:57:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:57:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:57:44,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:44,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058374736] [2024-11-10 09:57:44,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058374736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:44,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:44,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:57:44,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341888417] [2024-11-10 09:57:44,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:44,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:57:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:57:44,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:57:44,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:57:44,194 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 09:57:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:44,211 INFO L93 Difference]: Finished difference Result 187 states and 259 transitions. [2024-11-10 09:57:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:57:44,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-10 09:57:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:44,213 INFO L225 Difference]: With dead ends: 187 [2024-11-10 09:57:44,213 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 09:57:44,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:57:44,214 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:44,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:57:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 09:57:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 09:57:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 09:57:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2024-11-10 09:57:44,222 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 105 [2024-11-10 09:57:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:44,222 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2024-11-10 09:57:44,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 09:57:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2024-11-10 09:57:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:57:44,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:44,224 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:44,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:57:44,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:44,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:44,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1331135347, now seen corresponding path program 1 times [2024-11-10 09:57:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:44,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840460760] [2024-11-10 09:57:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:44,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:57:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:57:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:57:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:57:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:57:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:57:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:57:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:57:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:57:44,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:44,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840460760] [2024-11-10 09:57:44,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840460760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:44,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:44,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:57:44,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076797102] [2024-11-10 09:57:44,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:44,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:57:44,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:57:44,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:57:44,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:57:44,674 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 09:57:44,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:44,813 INFO L93 Difference]: Finished difference Result 185 states and 255 transitions. [2024-11-10 09:57:44,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:57:44,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-10 09:57:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:44,816 INFO L225 Difference]: With dead ends: 185 [2024-11-10 09:57:44,816 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 09:57:44,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:57:44,817 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 333 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:44,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 333 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:57:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 09:57:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 09:57:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 09:57:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 128 transitions. [2024-11-10 09:57:44,830 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 128 transitions. Word has length 105 [2024-11-10 09:57:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:44,832 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 128 transitions. [2024-11-10 09:57:44,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 09:57:44,832 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2024-11-10 09:57:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:57:44,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:44,834 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:44,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:57:44,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:44,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1362155154, now seen corresponding path program 1 times [2024-11-10 09:57:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:44,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673128506] [2024-11-10 09:57:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:45,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:45,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:57:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:45,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:57:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:45,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:57:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:45,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:57:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:57:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:57:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:45,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:45,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:57:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:45,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:57:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:57:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:45,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673128506] [2024-11-10 09:57:45,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673128506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:45,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:45,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:57:45,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087718361] [2024-11-10 09:57:45,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:45,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:57:45,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:57:45,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:57:45,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:57:45,319 INFO L87 Difference]: Start difference. First operand 94 states and 128 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 09:57:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:45,421 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2024-11-10 09:57:45,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:57:45,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-10 09:57:45,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:45,423 INFO L225 Difference]: With dead ends: 185 [2024-11-10 09:57:45,423 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 09:57:45,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:57:45,424 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:45,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:57:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 09:57:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 09:57:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 09:57:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2024-11-10 09:57:45,437 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 105 [2024-11-10 09:57:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:45,440 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2024-11-10 09:57:45,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 09:57:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2024-11-10 09:57:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:57:45,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:45,441 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:45,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:57:45,442 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:45,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:45,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1425260333, now seen corresponding path program 1 times [2024-11-10 09:57:45,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:45,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027886731] [2024-11-10 09:57:45,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:45,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:57:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:57:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:57:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:57:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:57:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:57:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:57:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:57:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:57:50,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:50,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027886731] [2024-11-10 09:57:50,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027886731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:50,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:50,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 09:57:50,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290827734] [2024-11-10 09:57:50,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:50,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 09:57:50,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:57:50,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 09:57:50,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-10 09:57:50,304 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-10 09:57:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:51,566 INFO L93 Difference]: Finished difference Result 190 states and 257 transitions. [2024-11-10 09:57:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 09:57:51,567 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2024-11-10 09:57:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:51,569 INFO L225 Difference]: With dead ends: 190 [2024-11-10 09:57:51,569 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 09:57:51,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-11-10 09:57:51,571 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 329 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:51,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 474 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:57:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 09:57:51,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-10 09:57:51,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 09:57:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2024-11-10 09:57:51,594 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 105 [2024-11-10 09:57:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:51,594 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2024-11-10 09:57:51,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-10 09:57:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2024-11-10 09:57:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:57:51,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:51,595 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:51,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:57:51,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:51,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:51,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1296177614, now seen corresponding path program 1 times [2024-11-10 09:57:51,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:51,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489389237] [2024-11-10 09:57:51,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:51,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:57:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:57:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:57:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:57:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:57:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:57:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:57:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:57:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-10 09:57:53,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:53,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489389237] [2024-11-10 09:57:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489389237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:57:53,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254570654] [2024-11-10 09:57:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:53,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:57:53,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:57:53,288 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:57:53,291 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:57:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:53,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-10 09:57:53,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:57:55,723 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-10 09:57:55,724 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 1 case distinctions, treesize of input 19 treesize of output 27 [2024-11-10 09:57:55,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:55,845 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 30 treesize of output 14 [2024-11-10 09:57:56,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:56,008 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 26 treesize of output 21 [2024-11-10 09:57:56,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:56,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:56,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:56,153 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-10 09:57:56,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2024-11-10 09:57:56,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:56,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:56,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:56,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:56,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:56,413 INFO L349 Elim1Store]: treesize reduction 72, result has 27.3 percent of original size [2024-11-10 09:57:56,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 53 [2024-11-10 09:57:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-10 09:57:56,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:58:37,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1986 treesize of output 1922 [2024-11-10 09:58:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:58:54,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254570654] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:58:54,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:58:54,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 37 [2024-11-10 09:58:54,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525377740] [2024-11-10 09:58:54,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:58:54,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 09:58:54,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:58:54,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 09:58:54,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1184, Unknown=12, NotChecked=0, Total=1332 [2024-11-10 09:58:54,457 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 09:58:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:58:55,555 INFO L93 Difference]: Finished difference Result 190 states and 255 transitions. [2024-11-10 09:58:55,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:58:55,556 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-10 09:58:55,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:58:55,557 INFO L225 Difference]: With dead ends: 190 [2024-11-10 09:58:55,557 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 09:58:55,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 58.2s TimeCoverageRelationStatistics Valid=195, Invalid=1599, Unknown=12, NotChecked=0, Total=1806 [2024-11-10 09:58:55,559 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 373 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:58:55,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 595 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:58:55,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 09:58:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2024-11-10 09:58:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.271604938271605) internal successors, (103), 81 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 09:58:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2024-11-10 09:58:55,579 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 125 transitions. Word has length 105 [2024-11-10 09:58:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:58:55,579 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 125 transitions. [2024-11-10 09:58:55,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 09:58:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2024-11-10 09:58:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 09:58:55,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:58:55,581 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:55,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 09:58:55,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:58:55,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:58:55,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:58:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1900374805, now seen corresponding path program 1 times [2024-11-10 09:58:55,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:58:55,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608717405] [2024-11-10 09:58:55,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:58:55,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:58:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:58:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:58:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:58:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:58:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:58:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:58:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:58:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:58:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:58:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:58:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:58:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-10 09:58:57,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:58:57,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608717405] [2024-11-10 09:58:57,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608717405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:58:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361171770] [2024-11-10 09:58:57,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:58:57,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:58:57,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:58:57,534 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:58:57,535 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:58:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:57,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-10 09:58:57,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:58:58,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:58:59,303 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 25 treesize of output 13 [2024-11-10 09:58:59,725 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 25 treesize of output 13 [2024-11-10 09:59:00,108 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 25 treesize of output 13 [2024-11-10 09:59:00,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:59:00,509 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-10 09:59:00,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 39 [2024-11-10 09:59:00,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:59:00,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:59:00,657 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-10 09:59:00,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2024-11-10 09:59:00,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:59:00,739 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 25 treesize of output 13 [2024-11-10 09:59:00,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:59:00,808 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-10 09:59:00,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-10 09:59:00,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:59:00,904 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-11-10 09:59:00,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 38 [2024-11-10 09:59:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-10 09:59:00,913 INFO L311 TraceCheckSpWp]: Computing backward predicates...