./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.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-92.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 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:03:24,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:03:24,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:03:24,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:03:24,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:03:24,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:03:24,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:03:24,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:03:24,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:03:24,295 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:03:24,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:03:24,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:03:24,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:03:24,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:03:24,297 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:03:24,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:03:24,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:03:24,301 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:03:24,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:03:24,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:03:24,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:03:24,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:03:24,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:03:24,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:03:24,303 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:03:24,303 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:03:24,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:03:24,304 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:03:24,304 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:03:24,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:03:24,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:03:24,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:03:24,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:03:24,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:03:24,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:03:24,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:03:24,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:03:24,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:03:24,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:03:24,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:03:24,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:03:24,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:03:24,308 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 -> 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 [2024-11-10 10:03:24,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:03:24,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:03:24,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:03:24,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:03:24,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:03:24,601 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-92.i [2024-11-10 10:03:26,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:03:26,281 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:03:26,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i [2024-11-10 10:03:26,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ed455a0/7596a925b0904892acd660a5791dd211/FLAG2abcfdb6d [2024-11-10 10:03:26,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ed455a0/7596a925b0904892acd660a5791dd211 [2024-11-10 10:03:26,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:03:26,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:03:26,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:03:26,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:03:26,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:03:26,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f25f472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26, skipping insertion in model container [2024-11-10 10:03:26,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:03:26,552 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-92.i[917,930] [2024-11-10 10:03:26,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:03:26,662 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:03:26,676 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-92.i[917,930] [2024-11-10 10:03:26,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:03:26,755 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:03:26,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26 WrapperNode [2024-11-10 10:03:26,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:03:26,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:03:26,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:03:26,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:03:26,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,831 INFO L138 Inliner]: procedures = 30, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2024-11-10 10:03:26,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:03:26,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:03:26,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:03:26,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:03:26,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,857 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,864 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 10:03:26,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:03:26,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:03:26,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:03:26,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:03:26,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (1/1) ... [2024-11-10 10:03:26,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:03:26,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:03:26,955 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 10:03:26,961 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 10:03:27,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:03:27,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 10:03:27,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 10:03:27,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 10:03:27,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 10:03:27,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 10:03:27,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 10:03:27,013 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 10:03:27,013 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 10:03:27,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 10:03:27,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:03:27,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:03:27,199 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:03:27,201 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:03:27,826 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~mem86#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~bitwise90#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~short97#1;havoc property_#t~mem102#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~short111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite120#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem119#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short118#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1; [2024-11-10 10:03:27,893 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-10 10:03:27,894 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:03:27,920 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:03:27,924 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:03:27,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:03:27 BoogieIcfgContainer [2024-11-10 10:03:27,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:03:27,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:03:27,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:03:27,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:03:27,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:03:26" (1/3) ... [2024-11-10 10:03:27,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62acf03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:03:27, skipping insertion in model container [2024-11-10 10:03:27,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:03:26" (2/3) ... [2024-11-10 10:03:27,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62acf03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:03:27, skipping insertion in model container [2024-11-10 10:03:27,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:03:27" (3/3) ... [2024-11-10 10:03:27,934 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-92.i [2024-11-10 10:03:27,953 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:03:27,953 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:03:28,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:03:28,019 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;@2e86b73b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:03:28,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 10:03:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 95 states have internal predecessors, (128), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 10:03:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 10:03:28,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:28,036 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:28,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:28,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1272331897, now seen corresponding path program 1 times [2024-11-10 10:03:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:03:28,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389433155] [2024-11-10 10:03:28,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:28,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:03:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:03:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:03:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:03:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:03:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:03:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:03:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:03:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:03:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:03:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:03:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:03:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:03:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:03:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:03:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:03:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:03:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:03:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:03:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:03:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 10:03:28,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:03:28,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389433155] [2024-11-10 10:03:28,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389433155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:28,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:28,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:03:28,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820341822] [2024-11-10 10:03:28,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:28,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:03:28,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:03:28,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:03:28,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:03:28,666 INFO L87 Difference]: Start difference. First operand has 116 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 95 states have internal predecessors, (128), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 10:03:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:28,710 INFO L93 Difference]: Finished difference Result 224 states and 344 transitions. [2024-11-10 10:03:28,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:03:28,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-10 10:03:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:28,722 INFO L225 Difference]: With dead ends: 224 [2024-11-10 10:03:28,722 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 10:03:28,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 10:03:28,732 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:28,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:03:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 10:03:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-10 10:03:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 10:03:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2024-11-10 10:03:28,772 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 155 [2024-11-10 10:03:28,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:28,772 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2024-11-10 10:03:28,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 10:03:28,773 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2024-11-10 10:03:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 10:03:28,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:28,777 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:28,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:03:28,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:28,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1591386680, now seen corresponding path program 1 times [2024-11-10 10:03:28,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:03:28,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851394109] [2024-11-10 10:03:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:28,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:03:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:03:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:03:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:03:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:03:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:03:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:03:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:03:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:03:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:03:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:03:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:03:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:32,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:03:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:32,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:03:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:32,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:03:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:32,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:03:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:32,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:03:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:32,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:03:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:32,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:03:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:32,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:03:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 10:03:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:03:32,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851394109] [2024-11-10 10:03:32,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851394109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:03:32,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020224604] [2024-11-10 10:03:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:32,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:03:32,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:03:32,068 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 10:03:32,069 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 10:03:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:32,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-10 10:03:32,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:03:32,572 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 10:03:33,026 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 23 treesize of output 11 [2024-11-10 10:03:33,311 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 23 treesize of output 11 [2024-11-10 10:03:33,592 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 23 treesize of output 11 [2024-11-10 10:03:33,926 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 23 treesize of output 11 [2024-11-10 10:03:34,174 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 23 treesize of output 11 [2024-11-10 10:03:34,381 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 23 treesize of output 11 [2024-11-10 10:03:34,597 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 23 treesize of output 11 [2024-11-10 10:03:34,981 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 23 treesize of output 11 [2024-11-10 10:03:35,233 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 23 treesize of output 11 [2024-11-10 10:03:35,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:03:35,462 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 23 treesize of output 11 [2024-11-10 10:03:35,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:03:35,514 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 23 treesize of output 11 [2024-11-10 10:03:35,537 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 15 treesize of output 7 [2024-11-10 10:03:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 16 proven. 184 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-10 10:03:35,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:03:35,585 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 (Array Int Int))) (or (not (= v_ArrVal_346 (store (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_346 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (< 0 (+ (select (select (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_346) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 1)))) is different from false [2024-11-10 10:03:35,622 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_344 Int) (v_ArrVal_346 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_344)))) (or (< 0 (+ (select (select (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_346) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 1)) (not (= v_ArrVal_346 (store (select .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_346 c_~WrapperStruct00_var_1_7_Pointer~0.offset))))))) is different from false [2024-11-10 10:03:35,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020224604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:03:35,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 10:03:35,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-10 10:03:35,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704036412] [2024-11-10 10:03:35,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 10:03:35,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 10:03:35,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:03:35,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 10:03:35,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=245, Unknown=2, NotChecked=66, Total=380 [2024-11-10 10:03:35,676 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 18 states, 16 states have (on average 7.0625) internal successors, (113), 18 states have internal predecessors, (113), 6 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-10 10:03:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:36,470 INFO L93 Difference]: Finished difference Result 228 states and 321 transitions. [2024-11-10 10:03:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:03:36,471 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 7.0625) internal successors, (113), 18 states have internal predecessors, (113), 6 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) Word has length 155 [2024-11-10 10:03:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:36,474 INFO L225 Difference]: With dead ends: 228 [2024-11-10 10:03:36,474 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 10:03:36,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=377, Unknown=2, NotChecked=86, Total=600 [2024-11-10 10:03:36,476 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 153 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:36,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 661 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 10:03:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 10:03:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2024-11-10 10:03:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 10:03:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2024-11-10 10:03:36,493 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 155 [2024-11-10 10:03:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:36,493 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2024-11-10 10:03:36,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 7.0625) internal successors, (113), 18 states have internal predecessors, (113), 6 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-10 10:03:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2024-11-10 10:03:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 10:03:36,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:36,499 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:36,518 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 10:03:36,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:03:36,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:36,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:36,701 INFO L85 PathProgramCache]: Analyzing trace with hash -446669609, now seen corresponding path program 1 times [2024-11-10 10:03:36,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:03:36,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550666584] [2024-11-10 10:03:36,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:36,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:03:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:45,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:03:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:45,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:03:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:45,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:03:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:45,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:03:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:45,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:03:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:45,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:03:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:03:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:03:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:03:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:03:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:03:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:03:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:03:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:03:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:03:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:03:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:03:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:03:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:03:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 10:03:46,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:03:46,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550666584] [2024-11-10 10:03:46,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550666584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:46,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:46,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 10:03:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947830901] [2024-11-10 10:03:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:46,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 10:03:46,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:03:46,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 10:03:46,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-10 10:03:46,322 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-10 10:03:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:48,690 INFO L93 Difference]: Finished difference Result 283 states and 395 transitions. [2024-11-10 10:03:48,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:03:48,693 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-10 10:03:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:48,694 INFO L225 Difference]: With dead ends: 283 [2024-11-10 10:03:48,695 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 10:03:48,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-11-10 10:03:48,700 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 314 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:48,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 590 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 10:03:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 10:03:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 133. [2024-11-10 10:03:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3243243243243243) internal successors, (147), 111 states have internal predecessors, (147), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 10:03:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 185 transitions. [2024-11-10 10:03:48,738 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 185 transitions. Word has length 155 [2024-11-10 10:03:48,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:48,739 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 185 transitions. [2024-11-10 10:03:48,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-10 10:03:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2024-11-10 10:03:48,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 10:03:48,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:48,745 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:48,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:03:48,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:48,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:48,746 INFO L85 PathProgramCache]: Analyzing trace with hash -957203786, now seen corresponding path program 1 times [2024-11-10 10:03:48,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:03:48,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292742400] [2024-11-10 10:03:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:48,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:03:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:03:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:03:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:03:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:03:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:03:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:03:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:03:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:03:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:03:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:03:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:03:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:03:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:03:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:03:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:03:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:03:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:03:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:03:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:03:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 10:03:53,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:03:53,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292742400] [2024-11-10 10:03:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292742400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:53,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 10:03:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054029057] [2024-11-10 10:03:53,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:53,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:03:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:03:53,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:03:53,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:03:53,499 INFO L87 Difference]: Start difference. First operand 133 states and 185 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 10:03:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:54,662 INFO L93 Difference]: Finished difference Result 299 states and 416 transitions. [2024-11-10 10:03:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:03:54,663 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-10 10:03:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:54,666 INFO L225 Difference]: With dead ends: 299 [2024-11-10 10:03:54,666 INFO L226 Difference]: Without dead ends: 169 [2024-11-10 10:03:54,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-10 10:03:54,668 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 334 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:54,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 468 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 10:03:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-10 10:03:54,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 133. [2024-11-10 10:03:54,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 111 states have internal predecessors, (146), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 10:03:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 184 transitions. [2024-11-10 10:03:54,698 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 184 transitions. Word has length 155 [2024-11-10 10:03:54,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:54,699 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 184 transitions. [2024-11-10 10:03:54,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 10:03:54,699 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 184 transitions. [2024-11-10 10:03:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 10:03:54,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:54,701 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:54,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:03:54,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:54,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash -701406154, now seen corresponding path program 1 times [2024-11-10 10:03:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:03:54,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978558566] [2024-11-10 10:03:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:03:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:03:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:03:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:03:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:03:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:03:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:03:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:03:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:03:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:03:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:03:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:03:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:03:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:03:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:03:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:03:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:03:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:03:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:03:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:03:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 10:03:58,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:03:58,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978558566] [2024-11-10 10:03:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978558566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:58,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:58,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 10:03:58,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018502813] [2024-11-10 10:03:58,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:58,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:03:58,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:03:58,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:03:58,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:03:58,865 INFO L87 Difference]: Start difference. First operand 133 states and 184 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 10:03:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:59,760 INFO L93 Difference]: Finished difference Result 303 states and 420 transitions. [2024-11-10 10:03:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:03:59,761 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-10 10:03:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:59,763 INFO L225 Difference]: With dead ends: 303 [2024-11-10 10:03:59,763 INFO L226 Difference]: Without dead ends: 173 [2024-11-10 10:03:59,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-10 10:03:59,764 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 278 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:59,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 396 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 10:03:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-10 10:03:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2024-11-10 10:03:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 113 states have internal predecessors, (148), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 10:03:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 186 transitions. [2024-11-10 10:03:59,792 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 186 transitions. Word has length 155 [2024-11-10 10:03:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:59,793 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 186 transitions. [2024-11-10 10:03:59,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 10:03:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 186 transitions. [2024-11-10 10:03:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 10:03:59,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:59,795 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:59,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:03:59,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:59,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1211940331, now seen corresponding path program 1 times [2024-11-10 10:03:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:03:59,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225771312] [2024-11-10 10:03:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:59,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:04:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:04:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:04:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:04:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:04:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:04:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:04:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:04:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:04:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:04:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:04:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:04:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:04:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:04:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:04:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:10,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:04:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:10,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:04:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:10,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:04:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:10,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:04:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:10,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:04:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 10:04:10,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:04:10,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225771312] [2024-11-10 10:04:10,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225771312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:04:10,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:04:10,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-10 10:04:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934194098] [2024-11-10 10:04:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:04:10,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 10:04:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:04:10,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 10:04:10,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-10 10:04:10,231 INFO L87 Difference]: Start difference. First operand 135 states and 186 transitions. Second operand has 18 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 18 states have internal predecessors, (66), 3 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-10 10:04:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:04:14,439 INFO L93 Difference]: Finished difference Result 307 states and 423 transitions. [2024-11-10 10:04:14,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 10:04:14,440 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 18 states have internal predecessors, (66), 3 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-10 10:04:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:04:14,441 INFO L225 Difference]: With dead ends: 307 [2024-11-10 10:04:14,441 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 10:04:14,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2024-11-10 10:04:14,443 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 382 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 10:04:14,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1000 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 10:04:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 10:04:14,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 135. [2024-11-10 10:04:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 113 states have internal predecessors, (148), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 10:04:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 186 transitions. [2024-11-10 10:04:14,498 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 186 transitions. Word has length 155 [2024-11-10 10:04:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:04:14,498 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 186 transitions. [2024-11-10 10:04:14,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 18 states have internal predecessors, (66), 3 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-10 10:04:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 186 transitions. [2024-11-10 10:04:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 10:04:14,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:04:14,502 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:14,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:04:14,502 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:04:14,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:04:14,503 INFO L85 PathProgramCache]: Analyzing trace with hash -362898503, now seen corresponding path program 1 times [2024-11-10 10:04:14,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:04:14,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765633161] [2024-11-10 10:04:14,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:04:14,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:04:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:04:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:15,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:04:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:15,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:04:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:15,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:04:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:15,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:04:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:15,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:04:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:15,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:04:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:15,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:04:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:04:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:04:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 10:04:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:04:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:04:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:04:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:04:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 10:04:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 10:04:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 10:04:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 10:04:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 10:04:16,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:04:16,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765633161] [2024-11-10 10:04:16,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765633161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:04:16,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700321370] [2024-11-10 10:04:16,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:04:16,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:04:16,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:04:16,107 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 10:04:16,110 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 10:04:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:04:16,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-10 10:04:16,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:04:18,504 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 10:04:19,455 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 23 treesize of output 11 [2024-11-10 10:04:20,126 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 23 treesize of output 11 [2024-11-10 10:04:20,636 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 23 treesize of output 11 [2024-11-10 10:04:21,093 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 23 treesize of output 11 [2024-11-10 10:04:22,077 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 23 treesize of output 11 [2024-11-10 10:04:22,728 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 23 treesize of output 11 [2024-11-10 10:04:23,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:23,426 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 23 treesize of output 11 [2024-11-10 10:04:23,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:23,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:23,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:23,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-10 10:04:23,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:23,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:23,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:23,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-10 10:04:23,997 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-10 10:04:23,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 62 [2024-11-10 10:04:24,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 73 [2024-11-10 10:04:24,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 24 treesize of output 31 [2024-11-10 10:04:24,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,196 INFO L349 Elim1Store]: treesize reduction 90, result has 23.1 percent of original size [2024-11-10 10:04:24,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 95 [2024-11-10 10:04:24,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,278 INFO L349 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2024-11-10 10:04:24,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 54 treesize of output 95 [2024-11-10 10:04:24,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:24,722 INFO L349 Elim1Store]: treesize reduction 64, result has 32.6 percent of original size [2024-11-10 10:04:24,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 72 [2024-11-10 10:04:25,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:25,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:25,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:25,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:25,062 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-10 10:04:25,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 31 [2024-11-10 10:04:25,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:04:25,133 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-10 10:04:25,134 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 43 treesize of output 31 [2024-11-10 10:04:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 268 proven. 166 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-10 10:04:25,178 INFO L311 TraceCheckSpWp]: Computing backward predicates...