./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-a_file-79.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 9d5c0cca82b2b1013f4104737c9e937fc2a95196aace035533aadd05da24a612 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:35:14,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:35:14,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:35:14,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:35:14,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:35:14,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:35:14,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:35:14,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:35:14,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:35:14,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:35:14,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:35:14,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:35:14,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:35:14,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:35:14,754 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:35:14,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:35:14,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:35:14,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:35:14,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:35:14,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:35:14,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:35:14,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:35:14,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:35:14,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:35:14,756 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:35:14,756 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:35:14,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:35:14,757 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:35:14,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:35:14,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:35:14,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:35:14,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:35:14,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:35:14,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:35:14,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:35:14,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:35:14,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:35:14,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:35:14,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:35:14,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:35:14,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:35:14,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:35:14,761 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 -> 9d5c0cca82b2b1013f4104737c9e937fc2a95196aace035533aadd05da24a612 [2024-11-09 01:35:14,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:35:14,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:35:14,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:35:14,989 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:35:14,990 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:35:14,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-79.i [2024-11-09 01:35:16,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:35:16,286 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:35:16,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-79.i [2024-11-09 01:35:16,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb009bf53/40295a94f80f42938b9cd1a49bab6ead/FLAGc4d669362 [2024-11-09 01:35:16,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb009bf53/40295a94f80f42938b9cd1a49bab6ead [2024-11-09 01:35:16,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:35:16,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:35:16,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:35:16,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:35:16,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:35:16,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:16,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3278a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16, skipping insertion in model container [2024-11-09 01:35:16,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:16,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:35:16,859 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-a_file-79.i[916,929] [2024-11-09 01:35:16,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:35:16,905 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:35:16,914 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-a_file-79.i[916,929] [2024-11-09 01:35:16,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:35:16,959 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:35:16,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16 WrapperNode [2024-11-09 01:35:16,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:35:16,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:35:16,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:35:16,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:35:16,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:16,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:17,008 INFO L138 Inliner]: procedures = 29, calls = 131, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2024-11-09 01:35:17,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:35:17,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:35:17,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:35:17,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:35:17,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:17,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:17,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:17,052 INFO L175 MemorySlicer]: Split 103 memory accesses to 7 slices as follows [2, 13, 18, 8, 45, 11, 6]. 44 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 1, 4, 1, 1]. The 15 writes are split as follows [0, 2, 2, 1, 5, 3, 2]. [2024-11-09 01:35:17,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:17,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:17,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:17,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:17,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:17,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:17,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:35:17,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:35:17,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:35:17,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:35:17,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (1/1) ... [2024-11-09 01:35:17,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:35:17,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:17,122 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-09 01:35:17,125 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-09 01:35:17,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:35:17,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:35:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:35:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:35:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:35:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:35:17,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:35:17,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 01:35:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:35:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:35:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:35:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:35:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:35:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:35:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-09 01:35:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:35:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:35:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:35:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:35:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:35:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:35:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-09 01:35:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:35:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:35:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:35:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:35:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:35:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:35:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 01:35:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:35:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:35:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:35:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:35:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:35:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:35:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-09 01:35:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:35:17,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:35:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:35:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:35:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:35:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:35:17,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:35:17,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:35:17,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 01:35:17,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:35:17,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:35:17,335 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:35:17,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:35:17,666 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-09 01:35:17,666 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:35:17,681 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:35:17,681 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:35:17,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:35:17 BoogieIcfgContainer [2024-11-09 01:35:17,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:35:17,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:35:17,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:35:17,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:35:17,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:35:16" (1/3) ... [2024-11-09 01:35:17,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7954ff73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:35:17, skipping insertion in model container [2024-11-09 01:35:17,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:16" (2/3) ... [2024-11-09 01:35:17,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7954ff73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:35:17, skipping insertion in model container [2024-11-09 01:35:17,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:35:17" (3/3) ... [2024-11-09 01:35:17,689 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-79.i [2024-11-09 01:35:17,704 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:35:17,704 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:35:17,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:35:17,760 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;@621ae125, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:35:17,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:35:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 01:35:17,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:17,771 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:17,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:17,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2025508539, now seen corresponding path program 1 times [2024-11-09 01:35:17,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:17,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951231513] [2024-11-09 01:35:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:17,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:18,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:18,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951231513] [2024-11-09 01:35:18,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951231513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:18,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:18,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:35:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926169309] [2024-11-09 01:35:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:18,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:35:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:18,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:35:18,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:35:18,102 INFO L87 Difference]: Start difference. First operand has 95 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:18,123 INFO L93 Difference]: Finished difference Result 183 states and 281 transitions. [2024-11-09 01:35:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:35:18,125 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-11-09 01:35:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:18,130 INFO L225 Difference]: With dead ends: 183 [2024-11-09 01:35:18,131 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 01:35:18,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:35:18,136 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:18,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 01:35:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 01:35:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-09 01:35:18,168 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 101 [2024-11-09 01:35:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:18,169 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-09 01:35:18,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-09 01:35:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 01:35:18,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:18,176 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:18,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:35:18,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:18,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:18,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1202698245, now seen corresponding path program 1 times [2024-11-09 01:35:18,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:18,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033393353] [2024-11-09 01:35:18,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:18,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:18,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:18,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033393353] [2024-11-09 01:35:18,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033393353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:18,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:18,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:18,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188503593] [2024-11-09 01:35:18,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:18,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:18,426 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:18,452 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2024-11-09 01:35:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:18,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-11-09 01:35:18,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:18,456 INFO L225 Difference]: With dead ends: 181 [2024-11-09 01:35:18,456 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 01:35:18,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:18,458 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:18,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 01:35:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 01:35:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-09 01:35:18,466 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 101 [2024-11-09 01:35:18,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:18,467 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-09 01:35:18,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-09 01:35:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 01:35:18,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:18,469 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:18,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:35:18,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:18,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1213138105, now seen corresponding path program 1 times [2024-11-09 01:35:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:18,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094086823] [2024-11-09 01:35:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:18,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:18,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094086823] [2024-11-09 01:35:18,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094086823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:18,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:18,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:18,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603335064] [2024-11-09 01:35:18,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:18,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:18,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:18,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:18,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:18,717 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:18,751 INFO L93 Difference]: Finished difference Result 185 states and 266 transitions. [2024-11-09 01:35:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-11-09 01:35:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:18,753 INFO L225 Difference]: With dead ends: 185 [2024-11-09 01:35:18,755 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 01:35:18,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:18,757 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:18,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 01:35:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 01:35:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-11-09 01:35:18,764 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 101 [2024-11-09 01:35:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:18,764 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-11-09 01:35:18,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-11-09 01:35:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:35:18,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:18,766 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:18,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:35:18,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:18,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:18,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2066727902, now seen corresponding path program 1 times [2024-11-09 01:35:18,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:18,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102010462] [2024-11-09 01:35:18,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:18,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:18,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:18,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102010462] [2024-11-09 01:35:18,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102010462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:18,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:18,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:18,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567145663] [2024-11-09 01:35:18,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:18,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:18,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:18,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:18,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:18,891 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:18,913 INFO L93 Difference]: Finished difference Result 190 states and 271 transitions. [2024-11-09 01:35:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:18,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-09 01:35:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:18,914 INFO L225 Difference]: With dead ends: 190 [2024-11-09 01:35:18,914 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 01:35:18,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:18,915 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:18,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 01:35:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-09 01:35:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2024-11-09 01:35:18,920 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 103 [2024-11-09 01:35:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:18,921 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2024-11-09 01:35:18,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2024-11-09 01:35:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:35:18,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:18,926 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:18,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:35:18,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:18,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2064880860, now seen corresponding path program 1 times [2024-11-09 01:35:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:18,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714477776] [2024-11-09 01:35:18,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:18,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:19,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:19,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:19,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:19,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:19,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:19,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:19,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:19,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:19,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:19,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:19,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714477776] [2024-11-09 01:35:19,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714477776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:19,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:19,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:19,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042731031] [2024-11-09 01:35:19,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:19,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:19,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:19,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:19,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:19,156 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:19,254 INFO L93 Difference]: Finished difference Result 275 states and 389 transitions. [2024-11-09 01:35:19,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:19,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-09 01:35:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:19,258 INFO L225 Difference]: With dead ends: 275 [2024-11-09 01:35:19,258 INFO L226 Difference]: Without dead ends: 181 [2024-11-09 01:35:19,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:19,259 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 111 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:19,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 747 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-09 01:35:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 99. [2024-11-09 01:35:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2024-11-09 01:35:19,271 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 103 [2024-11-09 01:35:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:19,271 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2024-11-09 01:35:19,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2024-11-09 01:35:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:35:19,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:19,274 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:19,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:35:19,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:19,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash 261437402, now seen corresponding path program 1 times [2024-11-09 01:35:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:19,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853891604] [2024-11-09 01:35:19,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:19,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:20,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853891604] [2024-11-09 01:35:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853891604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:20,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:20,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:35:20,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111109489] [2024-11-09 01:35:20,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:20,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:35:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:20,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:35:20,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:35:20,060 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:20,931 INFO L93 Difference]: Finished difference Result 658 states and 921 transitions. [2024-11-09 01:35:20,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 01:35:20,931 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-11-09 01:35:20,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:20,934 INFO L225 Difference]: With dead ends: 658 [2024-11-09 01:35:20,934 INFO L226 Difference]: Without dead ends: 562 [2024-11-09 01:35:20,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2024-11-09 01:35:20,936 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 869 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:20,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1630 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:35:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-09 01:35:20,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 363. [2024-11-09 01:35:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 318 states have (on average 1.3742138364779874) internal successors, (437), 320 states have internal predecessors, (437), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:35:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 517 transitions. [2024-11-09 01:35:20,968 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 517 transitions. Word has length 104 [2024-11-09 01:35:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:20,970 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 517 transitions. [2024-11-09 01:35:20,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 517 transitions. [2024-11-09 01:35:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 01:35:20,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:20,971 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:20,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:35:20,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:20,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1039852224, now seen corresponding path program 1 times [2024-11-09 01:35:20,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:20,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803204142] [2024-11-09 01:35:20,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:20,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:21,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:21,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:21,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:21,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:21,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:21,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:21,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:21,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:21,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:21,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:21,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:21,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803204142] [2024-11-09 01:35:21,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803204142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:21,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:21,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:35:21,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929989772] [2024-11-09 01:35:21,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:21,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:35:21,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:21,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:35:21,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:35:21,745 INFO L87 Difference]: Start difference. First operand 363 states and 517 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 01:35:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:22,163 INFO L93 Difference]: Finished difference Result 1015 states and 1440 transitions. [2024-11-09 01:35:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:35:22,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2024-11-09 01:35:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:22,168 INFO L225 Difference]: With dead ends: 1015 [2024-11-09 01:35:22,168 INFO L226 Difference]: Without dead ends: 655 [2024-11-09 01:35:22,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:35:22,170 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 208 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:22,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 868 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:35:22,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-11-09 01:35:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 363. [2024-11-09 01:35:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 318 states have (on average 1.3742138364779874) internal successors, (437), 320 states have internal predecessors, (437), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:35:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 517 transitions. [2024-11-09 01:35:22,205 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 517 transitions. Word has length 105 [2024-11-09 01:35:22,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:22,205 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 517 transitions. [2024-11-09 01:35:22,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 01:35:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 517 transitions. [2024-11-09 01:35:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:35:22,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:22,207 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:22,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:35:22,208 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:22,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:22,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1245149780, now seen corresponding path program 1 times [2024-11-09 01:35:22,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:22,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231482153] [2024-11-09 01:35:22,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:22,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231482153] [2024-11-09 01:35:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231482153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:22,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:35:22,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974958142] [2024-11-09 01:35:22,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:22,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:35:22,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:22,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:35:22,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:22,394 INFO L87 Difference]: Start difference. First operand 363 states and 517 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:22,528 INFO L93 Difference]: Finished difference Result 1041 states and 1477 transitions. [2024-11-09 01:35:22,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:35:22,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-09 01:35:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:22,532 INFO L225 Difference]: With dead ends: 1041 [2024-11-09 01:35:22,532 INFO L226 Difference]: Without dead ends: 681 [2024-11-09 01:35:22,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:35:22,533 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 88 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:22,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 687 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-09 01:35:22,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 675. [2024-11-09 01:35:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 606 states have (on average 1.3762376237623761) internal successors, (834), 612 states have internal predecessors, (834), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 01:35:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 954 transitions. [2024-11-09 01:35:22,568 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 954 transitions. Word has length 106 [2024-11-09 01:35:22,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:22,568 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 954 transitions. [2024-11-09 01:35:22,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 954 transitions. [2024-11-09 01:35:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:35:22,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:22,570 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:22,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:35:22,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:22,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:22,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1694498068, now seen corresponding path program 1 times [2024-11-09 01:35:22,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:22,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316070601] [2024-11-09 01:35:22,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:22,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:22,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316070601] [2024-11-09 01:35:22,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316070601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:22,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:22,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:22,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575154287] [2024-11-09 01:35:22,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:22,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:22,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:22,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:22,696 INFO L87 Difference]: Start difference. First operand 675 states and 954 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:22,846 INFO L93 Difference]: Finished difference Result 1875 states and 2640 transitions. [2024-11-09 01:35:22,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:22,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-09 01:35:22,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:22,852 INFO L225 Difference]: With dead ends: 1875 [2024-11-09 01:35:22,852 INFO L226 Difference]: Without dead ends: 1203 [2024-11-09 01:35:22,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:22,855 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 120 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:22,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 508 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2024-11-09 01:35:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 659. [2024-11-09 01:35:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 590 states have (on average 1.352542372881356) internal successors, (798), 596 states have internal predecessors, (798), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 01:35:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 918 transitions. [2024-11-09 01:35:22,911 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 918 transitions. Word has length 106 [2024-11-09 01:35:22,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:22,912 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 918 transitions. [2024-11-09 01:35:22,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 918 transitions. [2024-11-09 01:35:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:35:22,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:22,913 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:22,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:35:22,913 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:22,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:22,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1144390814, now seen corresponding path program 1 times [2024-11-09 01:35:22,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:22,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870256461] [2024-11-09 01:35:22,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:22,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:23,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870256461] [2024-11-09 01:35:23,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870256461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:23,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:23,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:23,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122148346] [2024-11-09 01:35:23,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:23,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:23,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:23,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:23,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:23,033 INFO L87 Difference]: Start difference. First operand 659 states and 918 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:23,083 INFO L93 Difference]: Finished difference Result 1251 states and 1745 transitions. [2024-11-09 01:35:23,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:23,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-09 01:35:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:23,087 INFO L225 Difference]: With dead ends: 1251 [2024-11-09 01:35:23,087 INFO L226 Difference]: Without dead ends: 595 [2024-11-09 01:35:23,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:23,088 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:23,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-09 01:35:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 591. [2024-11-09 01:35:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 522 states have (on average 1.3371647509578544) internal successors, (698), 528 states have internal predecessors, (698), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 01:35:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 818 transitions. [2024-11-09 01:35:23,128 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 818 transitions. Word has length 106 [2024-11-09 01:35:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:23,129 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 818 transitions. [2024-11-09 01:35:23,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 818 transitions. [2024-11-09 01:35:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 01:35:23,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:23,130 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:23,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:35:23,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:23,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:23,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1335213979, now seen corresponding path program 1 times [2024-11-09 01:35:23,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:23,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718519658] [2024-11-09 01:35:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:23,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:23,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:23,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718519658] [2024-11-09 01:35:23,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718519658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:23,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:23,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:23,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205948407] [2024-11-09 01:35:23,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:23,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:23,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:23,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:23,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:23,232 INFO L87 Difference]: Start difference. First operand 591 states and 818 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:23,354 INFO L93 Difference]: Finished difference Result 1473 states and 2028 transitions. [2024-11-09 01:35:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:23,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-09 01:35:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:23,358 INFO L225 Difference]: With dead ends: 1473 [2024-11-09 01:35:23,358 INFO L226 Difference]: Without dead ends: 885 [2024-11-09 01:35:23,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:23,360 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 41 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:23,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 360 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-09 01:35:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 695. [2024-11-09 01:35:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 626 states have (on average 1.329073482428115) internal successors, (832), 632 states have internal predecessors, (832), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 01:35:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 952 transitions. [2024-11-09 01:35:23,398 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 952 transitions. Word has length 107 [2024-11-09 01:35:23,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:23,398 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 952 transitions. [2024-11-09 01:35:23,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 952 transitions. [2024-11-09 01:35:23,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 01:35:23,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:23,400 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:23,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:35:23,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:23,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1922019993, now seen corresponding path program 1 times [2024-11-09 01:35:23,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:23,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057412810] [2024-11-09 01:35:23,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:23,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 01:35:23,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:23,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057412810] [2024-11-09 01:35:23,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057412810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:23,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74137745] [2024-11-09 01:35:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:23,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:23,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:23,662 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-09 01:35:23,663 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-09 01:35:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:23,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 01:35:23,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:24,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-09 01:35:24,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:24,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-11-09 01:35:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 01:35:24,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 01:35:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74137745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:35:24,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:35:24,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2024-11-09 01:35:24,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466106133] [2024-11-09 01:35:24,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:35:24,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:35:24,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:24,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:35:24,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:35:24,286 INFO L87 Difference]: Start difference. First operand 695 states and 952 transitions. Second operand has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 01:35:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:24,523 INFO L93 Difference]: Finished difference Result 1129 states and 1541 transitions. [2024-11-09 01:35:24,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:35:24,524 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 107 [2024-11-09 01:35:24,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:24,525 INFO L225 Difference]: With dead ends: 1129 [2024-11-09 01:35:24,525 INFO L226 Difference]: Without dead ends: 437 [2024-11-09 01:35:24,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2024-11-09 01:35:24,527 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 169 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:24,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 622 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-09 01:35:24,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 203. [2024-11-09 01:35:24,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 181 states have (on average 1.281767955801105) internal successors, (232), 182 states have internal predecessors, (232), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:35:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 264 transitions. [2024-11-09 01:35:24,542 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 264 transitions. Word has length 107 [2024-11-09 01:35:24,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:24,542 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 264 transitions. [2024-11-09 01:35:24,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 01:35:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 264 transitions. [2024-11-09 01:35:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:35:24,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:24,543 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:24,558 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-09 01:35:24,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 01:35:24,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:24,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:24,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2122612556, now seen corresponding path program 1 times [2024-11-09 01:35:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:24,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714765816] [2024-11-09 01:35:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:35:24,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1937075466] [2024-11-09 01:35:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:24,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:24,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:24,785 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-09 01:35:24,786 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-09 01:35:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:25,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 01:35:25,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:25,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:35:25,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:35:25,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-09 01:35:25,128 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 25 treesize of output 13 [2024-11-09 01:35:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:25,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:25,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714765816] [2024-11-09 01:35:25,168 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:35:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937075466] [2024-11-09 01:35:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937075466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:25,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:35:25,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600486533] [2024-11-09 01:35:25,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:25,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:35:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:35:25,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:35:25,170 INFO L87 Difference]: Start difference. First operand 203 states and 264 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:25,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:25,385 INFO L93 Difference]: Finished difference Result 482 states and 627 transitions. [2024-11-09 01:35:25,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:35:25,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-09 01:35:25,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:25,387 INFO L225 Difference]: With dead ends: 482 [2024-11-09 01:35:25,387 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 01:35:25,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:35:25,388 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 44 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:25,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 717 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:35:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 01:35:25,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 237. [2024-11-09 01:35:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 215 states have (on average 1.2744186046511627) internal successors, (274), 216 states have internal predecessors, (274), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:35:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 306 transitions. [2024-11-09 01:35:25,406 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 306 transitions. Word has length 110 [2024-11-09 01:35:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:25,406 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 306 transitions. [2024-11-09 01:35:25,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 306 transitions. [2024-11-09 01:35:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:35:25,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:25,407 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:25,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:35:25,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 01:35:25,611 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:25,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:25,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1372957360, now seen corresponding path program 1 times [2024-11-09 01:35:25,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:25,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072713899] [2024-11-09 01:35:25,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:25,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:35:25,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619549257] [2024-11-09 01:35:25,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:25,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:25,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:25,652 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:35:25,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:35:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:25,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 01:35:25,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:25,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:35:25,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:35:25,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:25,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2024-11-09 01:35:25,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:25,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2024-11-09 01:35:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:25,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:25,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:25,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072713899] [2024-11-09 01:35:25,933 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:35:25,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619549257] [2024-11-09 01:35:25,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619549257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:25,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:25,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:35:25,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487825525] [2024-11-09 01:35:25,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:25,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:35:25,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:25,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:35:25,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:35:25,934 INFO L87 Difference]: Start difference. First operand 237 states and 306 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:26,150 INFO L93 Difference]: Finished difference Result 558 states and 725 transitions. [2024-11-09 01:35:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:35:26,150 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-09 01:35:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:26,151 INFO L225 Difference]: With dead ends: 558 [2024-11-09 01:35:26,152 INFO L226 Difference]: Without dead ends: 324 [2024-11-09 01:35:26,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:35:26,152 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 49 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:26,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 705 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:35:26,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-09 01:35:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 265. [2024-11-09 01:35:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 243 states have (on average 1.2757201646090535) internal successors, (310), 244 states have internal predecessors, (310), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:35:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 342 transitions. [2024-11-09 01:35:26,165 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 342 transitions. Word has length 110 [2024-11-09 01:35:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:26,166 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 342 transitions. [2024-11-09 01:35:26,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 342 transitions. [2024-11-09 01:35:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:35:26,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:26,180 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:26,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 01:35:26,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:26,381 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:26,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash 786151346, now seen corresponding path program 1 times [2024-11-09 01:35:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:26,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111419013] [2024-11-09 01:35:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:26,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:26,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:26,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111419013] [2024-11-09 01:35:26,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111419013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:26,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:26,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:26,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492770149] [2024-11-09 01:35:26,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:26,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:26,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:26,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:26,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:26,587 INFO L87 Difference]: Start difference. First operand 265 states and 342 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:26,699 INFO L93 Difference]: Finished difference Result 582 states and 753 transitions. [2024-11-09 01:35:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:26,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-09 01:35:26,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:26,701 INFO L225 Difference]: With dead ends: 582 [2024-11-09 01:35:26,701 INFO L226 Difference]: Without dead ends: 320 [2024-11-09 01:35:26,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:26,703 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 39 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:26,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 471 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-09 01:35:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 265. [2024-11-09 01:35:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 244 states have internal predecessors, (306), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:35:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 338 transitions. [2024-11-09 01:35:26,718 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 338 transitions. Word has length 110 [2024-11-09 01:35:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:26,718 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 338 transitions. [2024-11-09 01:35:26,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 338 transitions. [2024-11-09 01:35:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:35:26,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:26,720 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:26,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:35:26,720 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:26,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2042884438, now seen corresponding path program 1 times [2024-11-09 01:35:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:26,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492038140] [2024-11-09 01:35:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:26,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:35:26,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686755144] [2024-11-09 01:35:26,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:26,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:26,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:26,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:35:26,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:35:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:26,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 01:35:26,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:26,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:35:26,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:35:27,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-11-09 01:35:27,059 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 27 treesize of output 15 [2024-11-09 01:35:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:27,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:27,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:27,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492038140] [2024-11-09 01:35:27,098 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:35:27,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686755144] [2024-11-09 01:35:27,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686755144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:27,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:27,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:35:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014519004] [2024-11-09 01:35:27,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:27,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:35:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:27,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:35:27,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:35:27,100 INFO L87 Difference]: Start difference. First operand 265 states and 338 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:27,352 INFO L93 Difference]: Finished difference Result 568 states and 724 transitions. [2024-11-09 01:35:27,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:35:27,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2024-11-09 01:35:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:27,354 INFO L225 Difference]: With dead ends: 568 [2024-11-09 01:35:27,354 INFO L226 Difference]: Without dead ends: 306 [2024-11-09 01:35:27,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:35:27,355 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 41 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:27,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 658 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:35:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-09 01:35:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 281. [2024-11-09 01:35:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 259 states have (on average 1.2548262548262548) internal successors, (325), 260 states have internal predecessors, (325), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:35:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 357 transitions. [2024-11-09 01:35:27,368 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 357 transitions. Word has length 111 [2024-11-09 01:35:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:27,368 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 357 transitions. [2024-11-09 01:35:27,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 357 transitions. [2024-11-09 01:35:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:35:27,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:27,369 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:27,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 01:35:27,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 01:35:27,570 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:27,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:27,571 INFO L85 PathProgramCache]: Analyzing trace with hash -820772203, now seen corresponding path program 1 times [2024-11-09 01:35:27,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:27,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767870021] [2024-11-09 01:35:27,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:27,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:28,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:28,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767870021] [2024-11-09 01:35:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767870021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:28,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:28,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:35:28,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499759658] [2024-11-09 01:35:28,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:28,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:35:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:28,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:35:28,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:35:28,056 INFO L87 Difference]: Start difference. First operand 281 states and 357 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:28,141 INFO L93 Difference]: Finished difference Result 289 states and 366 transitions. [2024-11-09 01:35:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:35:28,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-11-09 01:35:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:28,143 INFO L225 Difference]: With dead ends: 289 [2024-11-09 01:35:28,143 INFO L226 Difference]: Without dead ends: 287 [2024-11-09 01:35:28,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:35:28,144 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 26 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:28,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 694 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-09 01:35:28,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-09 01:35:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 265 states have (on average 1.2490566037735849) internal successors, (331), 266 states have internal predecessors, (331), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:35:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 363 transitions. [2024-11-09 01:35:28,164 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 363 transitions. Word has length 111 [2024-11-09 01:35:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:28,164 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 363 transitions. [2024-11-09 01:35:28,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 363 transitions. [2024-11-09 01:35:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:35:28,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:28,165 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:28,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:35:28,166 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:28,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash -818925161, now seen corresponding path program 1 times [2024-11-09 01:35:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:28,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483995734] [2024-11-09 01:35:28,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:28,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:28,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:28,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483995734] [2024-11-09 01:35:28,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483995734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:28,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:28,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:28,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338981351] [2024-11-09 01:35:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:28,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:28,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:28,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:28,291 INFO L87 Difference]: Start difference. First operand 287 states and 363 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:28,316 INFO L93 Difference]: Finished difference Result 577 states and 731 transitions. [2024-11-09 01:35:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:28,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2024-11-09 01:35:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:28,317 INFO L225 Difference]: With dead ends: 577 [2024-11-09 01:35:28,317 INFO L226 Difference]: Without dead ends: 293 [2024-11-09 01:35:28,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:28,318 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:28,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-09 01:35:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-11-09 01:35:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 271 states have (on average 1.2435424354243543) internal successors, (337), 272 states have internal predecessors, (337), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:35:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 369 transitions. [2024-11-09 01:35:28,330 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 369 transitions. Word has length 111 [2024-11-09 01:35:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:28,331 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 369 transitions. [2024-11-09 01:35:28,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 369 transitions. [2024-11-09 01:35:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:35:28,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:28,332 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:28,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:35:28,332 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:28,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash -873593326, now seen corresponding path program 1 times [2024-11-09 01:35:28,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:28,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067476278] [2024-11-09 01:35:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:28,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:28,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067476278] [2024-11-09 01:35:28,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067476278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:28,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:28,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:28,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963283460] [2024-11-09 01:35:28,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:28,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:28,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:28,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:28,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:28,472 INFO L87 Difference]: Start difference. First operand 293 states and 369 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:28,583 INFO L93 Difference]: Finished difference Result 652 states and 819 transitions. [2024-11-09 01:35:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:28,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2024-11-09 01:35:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:28,584 INFO L225 Difference]: With dead ends: 652 [2024-11-09 01:35:28,584 INFO L226 Difference]: Without dead ends: 362 [2024-11-09 01:35:28,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:28,585 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 34 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:28,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 369 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-09 01:35:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 308. [2024-11-09 01:35:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 286 states have (on average 1.2272727272727273) internal successors, (351), 287 states have internal predecessors, (351), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:35:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 383 transitions. [2024-11-09 01:35:28,597 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 383 transitions. Word has length 111 [2024-11-09 01:35:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:28,598 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 383 transitions. [2024-11-09 01:35:28,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 383 transitions. [2024-11-09 01:35:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:35:28,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:28,599 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:28,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 01:35:28,599 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:28,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1801929114, now seen corresponding path program 1 times [2024-11-09 01:35:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:28,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094996597] [2024-11-09 01:35:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:28,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:35:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:35:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:35:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:35:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:35:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:28,735 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:28,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:28,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094996597] [2024-11-09 01:35:28,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094996597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:28,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:28,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:28,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215581745] [2024-11-09 01:35:28,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:28,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:28,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:28,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:28,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:28,737 INFO L87 Difference]: Start difference. First operand 308 states and 383 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:28,848 INFO L93 Difference]: Finished difference Result 667 states and 829 transitions. [2024-11-09 01:35:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:28,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2024-11-09 01:35:28,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:28,849 INFO L225 Difference]: With dead ends: 667 [2024-11-09 01:35:28,849 INFO L226 Difference]: Without dead ends: 362 [2024-11-09 01:35:28,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:28,850 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 33 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:28,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 467 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:28,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-09 01:35:28,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 308. [2024-11-09 01:35:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 286 states have (on average 1.2202797202797202) internal successors, (349), 287 states have internal predecessors, (349), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:35:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 381 transitions. [2024-11-09 01:35:28,863 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 381 transitions. Word has length 111 [2024-11-09 01:35:28,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:28,864 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 381 transitions. [2024-11-09 01:35:28,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 381 transitions. [2024-11-09 01:35:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:35:28,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:28,866 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:28,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 01:35:28,866 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:28,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:28,867 INFO L85 PathProgramCache]: Analyzing trace with hash -785653014, now seen corresponding path program 1 times [2024-11-09 01:35:28,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:28,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659152449] [2024-11-09 01:35:28,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:28,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:35:28,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090851470] [2024-11-09 01:35:28,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:28,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:28,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:28,902 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:35:28,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:35:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:29,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 01:35:29,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:29,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:35:29,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:35:29,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:29,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-11-09 01:35:29,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:29,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 01:35:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:29,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:29,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:29,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659152449] [2024-11-09 01:35:29,201 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:35:29,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090851470] [2024-11-09 01:35:29,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090851470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:29,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:29,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:35:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121635249] [2024-11-09 01:35:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:29,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:35:29,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:29,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:35:29,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:35:29,203 INFO L87 Difference]: Start difference. First operand 308 states and 381 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:29,445 INFO L93 Difference]: Finished difference Result 636 states and 786 transitions. [2024-11-09 01:35:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:35:29,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2024-11-09 01:35:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:29,447 INFO L225 Difference]: With dead ends: 636 [2024-11-09 01:35:29,447 INFO L226 Difference]: Without dead ends: 331 [2024-11-09 01:35:29,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:35:29,448 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 27 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:29,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 921 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:35:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-09 01:35:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 306. [2024-11-09 01:35:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 284 states have (on average 1.221830985915493) internal successors, (347), 285 states have internal predecessors, (347), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:35:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 379 transitions. [2024-11-09 01:35:29,464 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 379 transitions. Word has length 111 [2024-11-09 01:35:29,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:29,464 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 379 transitions. [2024-11-09 01:35:29,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 379 transitions. [2024-11-09 01:35:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 01:35:29,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:29,465 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:29,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 01:35:29,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:29,666 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:29,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:29,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1636201285, now seen corresponding path program 1 times [2024-11-09 01:35:29,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:29,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835089092] [2024-11-09 01:35:29,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:29,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:35:29,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398859612] [2024-11-09 01:35:29,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:29,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:29,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:29,707 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:35:29,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 01:35:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:35:29,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:35:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:35:30,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:35:30,085 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:35:30,085 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:35:30,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 01:35:30,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:30,290 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:30,375 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:35:30,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:35:30 BoogieIcfgContainer [2024-11-09 01:35:30,379 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:35:30,380 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:35:30,380 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:35:30,380 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:35:30,381 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:35:17" (3/4) ... [2024-11-09 01:35:30,382 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:35:30,383 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:35:30,383 INFO L158 Benchmark]: Toolchain (without parser) took 13668.94ms. Allocated memory was 169.9MB in the beginning and 390.1MB in the end (delta: 220.2MB). Free memory was 129.1MB in the beginning and 246.5MB in the end (delta: -117.4MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. [2024-11-09 01:35:30,384 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 100.7MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:35:30,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.90ms. Allocated memory is still 169.9MB. Free memory was 129.1MB in the beginning and 112.9MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:35:30,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.02ms. Allocated memory is still 169.9MB. Free memory was 112.9MB in the beginning and 109.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:35:30,384 INFO L158 Benchmark]: Boogie Preprocessor took 82.16ms. Allocated memory is still 169.9MB. Free memory was 109.2MB in the beginning and 104.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:35:30,385 INFO L158 Benchmark]: RCFGBuilder took 588.24ms. Allocated memory is still 169.9MB. Free memory was 104.5MB in the beginning and 111.3MB in the end (delta: -6.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 01:35:30,387 INFO L158 Benchmark]: TraceAbstraction took 12696.10ms. Allocated memory was 169.9MB in the beginning and 390.1MB in the end (delta: 220.2MB). Free memory was 110.2MB in the beginning and 247.5MB in the end (delta: -137.4MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2024-11-09 01:35:30,387 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 390.1MB. Free memory was 247.5MB in the beginning and 246.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:35:30,388 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 100.7MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.90ms. Allocated memory is still 169.9MB. Free memory was 129.1MB in the beginning and 112.9MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.02ms. Allocated memory is still 169.9MB. Free memory was 112.9MB in the beginning and 109.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.16ms. Allocated memory is still 169.9MB. Free memory was 109.2MB in the beginning and 104.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 588.24ms. Allocated memory is still 169.9MB. Free memory was 104.5MB in the beginning and 111.3MB in the end (delta: -6.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12696.10ms. Allocated memory was 169.9MB in the beginning and 390.1MB in the end (delta: 220.2MB). Free memory was 110.2MB in the beginning and 247.5MB in the end (delta: -137.4MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 390.1MB. Free memory was 247.5MB in the beginning and 246.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 1.6, 32.5 }; [L25-L27] double double_Array_0[2] = { 1.6, 32.5 }; [L25-L27] double double_Array_0[2] = { 1.6, 32.5 }; [L28-L30] float float_Array_0[1] = { 15.5 }; [L28-L30] float float_Array_0[1] = { 15.5 }; [L31-L33] signed char signed_char_Array_0[2][2] = { {64, 0}, {64, -16} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {64, 0}, {64, -16} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {64, 0}, {64, -16} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {64, 0}, {64, -16} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {64, 0}, {64, -16} }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -64 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -64 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L40] unsigned short int last_1_unsigned_short_int_Array_0_0_ = 32; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] EXPR unsigned_short_int_Array_0[0] [L92] last_1_unsigned_short_int_Array_0_0_ = unsigned_short_int_Array_0[0] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L72] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] double_Array_0[0] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] double_Array_0[1] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] float_Array_0[0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L82] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L85] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[1][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L88] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] RET updateVariables() [L104] CALL step() [L44] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] EXPR ((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_) [L44] EXPR ((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] signed long int stepLocal_0 = (((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_)); [L45] EXPR signed_char_Array_0[1][0] [L45] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] EXPR last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_0=32, unsigned_short_int_Array_0={9:0}] [L45] COND TRUE stepLocal_0 <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1])) [L46] EXPR double_Array_0[1] [L46] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L46] COND FALSE !((- double_Array_0[1]) >= double_Array_0[0]) [L49] EXPR signed_char_Array_0[0][0] [L49] signed_long_int_Array_0[0] = signed_char_Array_0[0][0] [L54] EXPR signed_char_Array_0[0][0] [L54] EXPR signed_long_int_Array_0[0] [L54] signed long int stepLocal_1 = signed_char_Array_0[0][0] + signed_long_int_Array_0[0]; [L55] EXPR float_Array_0[0] [L55] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] COND FALSE !(float_Array_0[0] < double_Array_0[0]) [L62] EXPR BOOL_unsigned_char_Array_0[1] [L62] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L63] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L63] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L64] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L65] EXPR signed_char_Array_0[0][1] [L65] signed_char_Array_0[1][1] = (signed_char_Array_0[0][1] + -32) [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1 [L95] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16)))))) [L95] EXPR signed_char_Array_0[1][1] [L95] EXPR signed_char_Array_0[0][1] [L95] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) [L95] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_) [L95] EXPR ((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR signed_char_Array_0[1][0] [L95] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])) [L95] EXPR double_Array_0[1] [L95] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])) [L95] EXPR signed_long_int_Array_0[0] [L95] EXPR signed_char_Array_0[1][0] [L95] EXPR ((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])))) && ((float_Array_0[0] < double_Array_0[0]) ? (((signed_char_Array_0[0][0] + signed_long_int_Array_0[0]) <= (~ (signed_long_int_Array_0[0] % -32))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])))) && ((float_Array_0[0] < double_Array_0[0]) ? (((signed_char_Array_0[0][0] + signed_long_int_Array_0[0]) <= (~ (signed_long_int_Array_0[0] % -32))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])))) && ((float_Array_0[0] < double_Array_0[0]) ? (((signed_char_Array_0[0][0] + signed_long_int_Array_0[0]) <= (~ (signed_long_int_Array_0[0] % -32))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])))) && ((float_Array_0[0] < double_Array_0[0]) ? (((signed_char_Array_0[0][0] + signed_long_int_Array_0[0]) <= (~ (signed_long_int_Array_0[0] % -32))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95-L96] return ((((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])))) && ((float_Array_0[0] < double_Array_0[0]) ? (((signed_char_Array_0[0][0] + signed_long_int_Array_0[0]) <= (~ (signed_long_int_Array_0[0] % -32))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1903 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1900 mSDsluCounter, 12482 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9641 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3329 IncrementalHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 2841 mSDtfsCounter, 3329 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1200 GetRequests, 1049 SyntacticMatches, 2 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=695occurred in iteration=11, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 1869 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 3019 NumberOfCodeBlocks, 3019 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2437 ConstructedInterpolants, 0 QuantifiedInterpolants, 7518 SizeOfPredicates, 22 NumberOfNonLiveVariables, 2053 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 4979/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:35:30,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-a_file-79.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 9d5c0cca82b2b1013f4104737c9e937fc2a95196aace035533aadd05da24a612 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:35:32,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:35:32,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:35:32,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:35:32,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:35:32,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:35:32,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:35:32,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:35:32,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:35:32,283 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:35:32,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:35:32,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:35:32,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:35:32,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:35:32,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:35:32,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:35:32,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:35:32,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:35:32,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:35:32,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:35:32,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:35:32,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:35:32,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:35:32,294 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:35:32,294 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:35:32,294 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:35:32,294 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:35:32,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:35:32,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:35:32,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:35:32,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:35:32,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:35:32,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:35:32,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:35:32,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:35:32,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:35:32,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:35:32,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:35:32,296 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:35:32,297 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:35:32,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:35:32,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:35:32,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:35:32,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:35:32,298 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 -> 9d5c0cca82b2b1013f4104737c9e937fc2a95196aace035533aadd05da24a612 [2024-11-09 01:35:32,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:35:32,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:35:32,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:35:32,566 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:35:32,567 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:35:32,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-79.i [2024-11-09 01:35:33,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:35:34,024 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:35:34,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-79.i [2024-11-09 01:35:34,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d85c38b/d5cdb002dc1a44feb5769a5ec6bd05cc/FLAG4adca48a1 [2024-11-09 01:35:34,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d85c38b/d5cdb002dc1a44feb5769a5ec6bd05cc [2024-11-09 01:35:34,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:35:34,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:35:34,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:35:34,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:35:34,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:35:34,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c0d252a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34, skipping insertion in model container [2024-11-09 01:35:34,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:35:34,604 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-a_file-79.i[916,929] [2024-11-09 01:35:34,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:35:34,685 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:35:34,694 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-a_file-79.i[916,929] [2024-11-09 01:35:34,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:35:34,766 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:35:34,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34 WrapperNode [2024-11-09 01:35:34,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:35:34,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:35:34,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:35:34,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:35:34,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,824 INFO L138 Inliner]: procedures = 39, calls = 131, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 396 [2024-11-09 01:35:34,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:35:34,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:35:34,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:35:34,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:35:34,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,858 INFO L175 MemorySlicer]: Split 103 memory accesses to 7 slices as follows [2, 13, 18, 8, 45, 11, 6]. 44 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 1, 4, 1, 1]. The 15 writes are split as follows [0, 2, 2, 1, 5, 3, 2]. [2024-11-09 01:35:34,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:35:34,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:35:34,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:35:34,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:35:34,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (1/1) ... [2024-11-09 01:35:34,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:35:34,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:34,939 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-09 01:35:34,945 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-09 01:35:34,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:35:34,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 01:35:34,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 01:35:34,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-09 01:35:34,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-09 01:35:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-09 01:35:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-09 01:35:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-09 01:35:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 01:35:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 01:35:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-09 01:35:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-09 01:35:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-09 01:35:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:35:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:35:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 01:35:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-09 01:35:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:35:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:35:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:35:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:35:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:35:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:35:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 01:35:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:35:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:35:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:35:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:35:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:35:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 01:35:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-09 01:35:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:35:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:35:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:35:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:35:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:35:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-09 01:35:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-09 01:35:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-09 01:35:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-09 01:35:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-09 01:35:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-09 01:35:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-09 01:35:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-09 01:35:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-09 01:35:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:35:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:35:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:35:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:35:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:35:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 01:35:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-09 01:35:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:35:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:35:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:35:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:35:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:35:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-09 01:35:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-09 01:35:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:35:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:35:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:35:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:35:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:35:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-09 01:35:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-09 01:35:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:35:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:35:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:35:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:35:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:35:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-09 01:35:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-09 01:35:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:35:34,992 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:35:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:35:34,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:35:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:35:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:35:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:35:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:35:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:35:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:35:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 01:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-09 01:35:35,162 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:35:35,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:35:35,761 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-09 01:35:35,761 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:35:35,776 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:35:35,776 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:35:35,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:35:35 BoogieIcfgContainer [2024-11-09 01:35:35,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:35:35,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:35:35,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:35:35,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:35:35,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:35:34" (1/3) ... [2024-11-09 01:35:35,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c12fd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:35:35, skipping insertion in model container [2024-11-09 01:35:35,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:34" (2/3) ... [2024-11-09 01:35:35,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c12fd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:35:35, skipping insertion in model container [2024-11-09 01:35:35,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:35:35" (3/3) ... [2024-11-09 01:35:35,783 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-79.i [2024-11-09 01:35:35,795 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:35:35,795 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:35:35,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:35:35,847 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;@366e63f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:35:35,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:35:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 78 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:35:35,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:35,859 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:35,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:35,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:35,862 INFO L85 PathProgramCache]: Analyzing trace with hash 503815468, now seen corresponding path program 1 times [2024-11-09 01:35:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:35,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202630991] [2024-11-09 01:35:35,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:35,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:35,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:35,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:35,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:35:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:36,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:35:36,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-09 01:35:36,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:36,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:36,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202630991] [2024-11-09 01:35:36,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202630991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:36,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:36,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:35:36,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127947275] [2024-11-09 01:35:36,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:36,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:35:36,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:36,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:35:36,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:35:36,218 INFO L87 Difference]: Start difference. First operand has 91 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 78 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:36,240 INFO L93 Difference]: Finished difference Result 175 states and 269 transitions. [2024-11-09 01:35:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:35:36,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-11-09 01:35:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:36,247 INFO L225 Difference]: With dead ends: 175 [2024-11-09 01:35:36,247 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 01:35:36,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-09 01:35:36,252 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:36,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 01:35:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 01:35:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2024-11-09 01:35:36,281 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 100 [2024-11-09 01:35:36,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:36,281 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2024-11-09 01:35:36,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:36,282 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2024-11-09 01:35:36,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:35:36,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:36,285 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:36,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:35:36,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:36,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:36,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:36,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2139841186, now seen corresponding path program 1 times [2024-11-09 01:35:36,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:36,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174027666] [2024-11-09 01:35:36,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:36,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:36,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:36,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:36,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:35:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:36,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:35:36,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 01:35:36,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:36,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:36,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174027666] [2024-11-09 01:35:36,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174027666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:36,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:36,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:36,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681937008] [2024-11-09 01:35:36,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:36,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:36,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:36,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:36,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:36,756 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:36,802 INFO L93 Difference]: Finished difference Result 173 states and 250 transitions. [2024-11-09 01:35:36,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:36,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-11-09 01:35:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:36,804 INFO L225 Difference]: With dead ends: 173 [2024-11-09 01:35:36,804 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 01:35:36,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:36,805 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:36,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 01:35:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 01:35:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2024-11-09 01:35:36,819 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 100 [2024-11-09 01:35:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:36,820 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2024-11-09 01:35:36,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:36,820 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-11-09 01:35:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:35:36,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:36,822 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:36,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 01:35:37,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:37,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:37,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:37,029 INFO L85 PathProgramCache]: Analyzing trace with hash 814984992, now seen corresponding path program 1 times [2024-11-09 01:35:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:37,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557095339] [2024-11-09 01:35:37,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:37,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:37,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:37,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:37,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:35:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:37,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:35:37,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:37,485 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 24 treesize of output 12 [2024-11-09 01:35:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 01:35:37,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 01:35:37,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:37,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557095339] [2024-11-09 01:35:37,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557095339] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:35:37,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:35:37,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-09 01:35:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593501642] [2024-11-09 01:35:37,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:35:37,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:35:37,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:37,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:35:37,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:35:37,761 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 11 states, 9 states have (on average 6.666666666666667) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 01:35:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:37,988 INFO L93 Difference]: Finished difference Result 181 states and 256 transitions. [2024-11-09 01:35:37,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:35:37,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.666666666666667) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 100 [2024-11-09 01:35:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:37,990 INFO L225 Difference]: With dead ends: 181 [2024-11-09 01:35:37,990 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 01:35:37,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:35:37,991 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 142 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:37,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 496 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:35:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 01:35:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-11-09 01:35:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 79 states have internal predecessors, (107), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2024-11-09 01:35:38,005 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 100 [2024-11-09 01:35:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:38,005 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2024-11-09 01:35:38,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.666666666666667) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 01:35:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2024-11-09 01:35:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 01:35:38,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:38,006 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:38,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 01:35:38,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:38,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1041802097, now seen corresponding path program 1 times [2024-11-09 01:35:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730090249] [2024-11-09 01:35:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:38,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:38,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:38,212 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:38,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:35:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:38,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:35:38,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:38,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-09 01:35:38,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:38,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-09 01:35:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 01:35:38,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 01:35:38,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:38,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730090249] [2024-11-09 01:35:38,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730090249] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:35:38,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:35:38,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-09 01:35:38,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119478462] [2024-11-09 01:35:38,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:35:38,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:35:38,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:38,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:35:38,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:35:38,852 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 13 states, 11 states have (on average 5.818181818181818) internal successors, (64), 13 states have internal predecessors, (64), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 01:35:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:39,167 INFO L93 Difference]: Finished difference Result 185 states and 257 transitions. [2024-11-09 01:35:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:35:39,167 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.818181818181818) internal successors, (64), 13 states have internal predecessors, (64), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 101 [2024-11-09 01:35:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:39,168 INFO L225 Difference]: With dead ends: 185 [2024-11-09 01:35:39,169 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 01:35:39,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:35:39,170 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 212 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:39,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 534 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:35:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 01:35:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-11-09 01:35:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2024-11-09 01:35:39,183 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 101 [2024-11-09 01:35:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:39,184 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2024-11-09 01:35:39,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.818181818181818) internal successors, (64), 13 states have internal predecessors, (64), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 01:35:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2024-11-09 01:35:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:35:39,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:39,185 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:39,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 01:35:39,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:39,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:39,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1690934070, now seen corresponding path program 1 times [2024-11-09 01:35:39,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:39,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026285795] [2024-11-09 01:35:39,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:39,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:39,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:39,389 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:39,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 01:35:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:39,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:35:39,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:39,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:39,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:39,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026285795] [2024-11-09 01:35:39,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026285795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:39,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:39,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:39,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453099721] [2024-11-09 01:35:39,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:39,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:39,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:39,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:39,572 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:39,611 INFO L93 Difference]: Finished difference Result 188 states and 260 transitions. [2024-11-09 01:35:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-09 01:35:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:39,614 INFO L225 Difference]: With dead ends: 188 [2024-11-09 01:35:39,614 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 01:35:39,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:39,615 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:39,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 459 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:39,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 01:35:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-09 01:35:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 132 transitions. [2024-11-09 01:35:39,621 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 132 transitions. Word has length 103 [2024-11-09 01:35:39,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:39,622 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 132 transitions. [2024-11-09 01:35:39,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 132 transitions. [2024-11-09 01:35:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:35:39,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:39,623 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:39,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 01:35:39,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:39,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:39,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:39,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1689087028, now seen corresponding path program 1 times [2024-11-09 01:35:39,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:39,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298018994] [2024-11-09 01:35:39,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:39,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:39,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:39,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:39,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 01:35:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:40,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 01:35:40,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:40,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:35:40,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2024-11-09 01:35:40,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:40,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 52 [2024-11-09 01:35:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 01:35:40,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:40,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:40,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298018994] [2024-11-09 01:35:40,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298018994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:40,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:40,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 01:35:40,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546961] [2024-11-09 01:35:40,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:40,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 01:35:40,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:40,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 01:35:40,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:35:40,343 INFO L87 Difference]: Start difference. First operand 97 states and 132 transitions. Second operand has 14 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 01:35:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:41,256 INFO L93 Difference]: Finished difference Result 283 states and 378 transitions. [2024-11-09 01:35:41,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 01:35:41,256 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2024-11-09 01:35:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:41,258 INFO L225 Difference]: With dead ends: 283 [2024-11-09 01:35:41,258 INFO L226 Difference]: Without dead ends: 189 [2024-11-09 01:35:41,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:35:41,259 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 221 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:41,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1002 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:35:41,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-09 01:35:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 111. [2024-11-09 01:35:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 95 states have internal predecessors, (123), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 145 transitions. [2024-11-09 01:35:41,270 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 145 transitions. Word has length 103 [2024-11-09 01:35:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:41,270 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 145 transitions. [2024-11-09 01:35:41,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 01:35:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2024-11-09 01:35:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 01:35:41,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:41,272 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:41,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 01:35:41,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:41,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1223090714, now seen corresponding path program 1 times [2024-11-09 01:35:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731849018] [2024-11-09 01:35:41,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:41,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:41,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:41,474 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:41,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 01:35:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:41,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:35:41,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:41,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-09 01:35:41,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:41,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-09 01:35:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 01:35:41,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 01:35:42,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:42,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731849018] [2024-11-09 01:35:42,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731849018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:35:42,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:35:42,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-09 01:35:42,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338723264] [2024-11-09 01:35:42,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:35:42,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:35:42,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:42,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:35:42,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:35:42,062 INFO L87 Difference]: Start difference. First operand 111 states and 145 transitions. Second operand has 13 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 13 states have internal predecessors, (69), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 01:35:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:42,321 INFO L93 Difference]: Finished difference Result 219 states and 286 transitions. [2024-11-09 01:35:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:35:42,322 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 13 states have internal predecessors, (69), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 105 [2024-11-09 01:35:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:42,323 INFO L225 Difference]: With dead ends: 219 [2024-11-09 01:35:42,323 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 01:35:42,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:35:42,324 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 344 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:42,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 508 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 01:35:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-09 01:35:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 93 states have internal predecessors, (118), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 140 transitions. [2024-11-09 01:35:42,336 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 140 transitions. Word has length 105 [2024-11-09 01:35:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:42,337 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 140 transitions. [2024-11-09 01:35:42,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 13 states have internal predecessors, (69), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 01:35:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2024-11-09 01:35:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 01:35:42,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:42,338 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:42,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 01:35:42,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:42,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:42,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:42,545 INFO L85 PathProgramCache]: Analyzing trace with hash -752129614, now seen corresponding path program 1 times [2024-11-09 01:35:42,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:42,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037061677] [2024-11-09 01:35:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:42,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:42,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:42,547 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:42,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 01:35:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:35:42,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:42,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-09 01:35:42,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:42,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-09 01:35:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 01:35:42,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 01:35:43,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:43,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037061677] [2024-11-09 01:35:43,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037061677] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:35:43,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:35:43,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-09 01:35:43,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252363933] [2024-11-09 01:35:43,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:35:43,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:35:43,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:43,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:35:43,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:35:43,099 INFO L87 Difference]: Start difference. First operand 109 states and 140 transitions. Second operand has 13 states, 11 states have (on average 6.0) internal successors, (66), 13 states have internal predecessors, (66), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 01:35:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:43,352 INFO L93 Difference]: Finished difference Result 207 states and 267 transitions. [2024-11-09 01:35:43,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:35:43,354 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.0) internal successors, (66), 13 states have internal predecessors, (66), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 105 [2024-11-09 01:35:43,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:43,355 INFO L225 Difference]: With dead ends: 207 [2024-11-09 01:35:43,355 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 01:35:43,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:35:43,356 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 192 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:43,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 484 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:43,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 01:35:43,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-11-09 01:35:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2024-11-09 01:35:43,363 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 105 [2024-11-09 01:35:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:43,364 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2024-11-09 01:35:43,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.0) internal successors, (66), 13 states have internal predecessors, (66), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 01:35:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2024-11-09 01:35:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 01:35:43,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:43,367 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:43,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 01:35:43,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:43,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:43,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:43,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1310795771, now seen corresponding path program 1 times [2024-11-09 01:35:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:43,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367317750] [2024-11-09 01:35:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:43,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:43,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:43,573 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:43,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 01:35:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 01:35:43,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:43,830 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 8 treesize of output 1 [2024-11-09 01:35:43,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:35:43,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:35:43,841 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 17 treesize of output 13 [2024-11-09 01:35:43,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-09 01:35:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:43,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:43,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:43,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367317750] [2024-11-09 01:35:43,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367317750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:43,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:43,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:35:43,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839275061] [2024-11-09 01:35:43,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:43,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:35:43,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:43,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:35:43,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:43,895 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:44,273 INFO L93 Difference]: Finished difference Result 269 states and 347 transitions. [2024-11-09 01:35:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:35:44,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-09 01:35:44,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:44,275 INFO L225 Difference]: With dead ends: 269 [2024-11-09 01:35:44,275 INFO L226 Difference]: Without dead ends: 173 [2024-11-09 01:35:44,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:35:44,276 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 74 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:44,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 656 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:35:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-09 01:35:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2024-11-09 01:35:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 148 states have internal predecessors, (188), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:35:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 220 transitions. [2024-11-09 01:35:44,285 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 220 transitions. Word has length 107 [2024-11-09 01:35:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:44,286 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 220 transitions. [2024-11-09 01:35:44,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 220 transitions. [2024-11-09 01:35:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:44,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:44,287 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:44,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 01:35:44,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:44,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:44,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:44,488 INFO L85 PathProgramCache]: Analyzing trace with hash -764141453, now seen corresponding path program 1 times [2024-11-09 01:35:44,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:44,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152511673] [2024-11-09 01:35:44,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:44,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:44,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:44,490 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:44,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 01:35:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:35:44,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:44,777 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 17 treesize of output 9 [2024-11-09 01:35:44,824 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 8 treesize of output 1 [2024-11-09 01:35:44,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-09 01:35:44,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:44,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-11-09 01:35:45,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:45,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 33 [2024-11-09 01:35:45,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:45,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 21 [2024-11-09 01:35:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 136 proven. 15 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 01:35:45,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:45,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:45,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152511673] [2024-11-09 01:35:45,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152511673] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:45,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:35:45,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-09 01:35:45,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242338065] [2024-11-09 01:35:45,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:45,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:45,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:45,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:45,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:35:45,415 INFO L87 Difference]: Start difference. First operand 170 states and 220 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:45,644 INFO L93 Difference]: Finished difference Result 411 states and 532 transitions. [2024-11-09 01:35:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:45,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-09 01:35:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:45,647 INFO L225 Difference]: With dead ends: 411 [2024-11-09 01:35:45,647 INFO L226 Difference]: Without dead ends: 244 [2024-11-09 01:35:45,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:35:45,648 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 64 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:45,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 260 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:35:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-09 01:35:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 199. [2024-11-09 01:35:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 176 states have (on average 1.2670454545454546) internal successors, (223), 177 states have internal predecessors, (223), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:35:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 255 transitions. [2024-11-09 01:35:45,657 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 255 transitions. Word has length 108 [2024-11-09 01:35:45,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:45,658 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 255 transitions. [2024-11-09 01:35:45,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 255 transitions. [2024-11-09 01:35:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:45,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:45,659 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:45,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 01:35:45,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:45,859 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:45,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash -505976015, now seen corresponding path program 1 times [2024-11-09 01:35:45,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:45,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587130857] [2024-11-09 01:35:45,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:45,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:45,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:45,862 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:45,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 01:35:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 01:35:46,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:46,107 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 17 treesize of output 9 [2024-11-09 01:35:46,164 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 14 treesize of output 10 [2024-11-09 01:35:46,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:35:46,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:46,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 36 [2024-11-09 01:35:46,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:46,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 26 [2024-11-09 01:35:46,850 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-09 01:35:46,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:46,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:46,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587130857] [2024-11-09 01:35:46,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587130857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:46,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:46,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:35:46,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214492925] [2024-11-09 01:35:46,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:46,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:35:46,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:46,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:35:46,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:35:46,852 INFO L87 Difference]: Start difference. First operand 199 states and 255 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:48,710 INFO L93 Difference]: Finished difference Result 858 states and 1095 transitions. [2024-11-09 01:35:48,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:35:48,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-09 01:35:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:48,713 INFO L225 Difference]: With dead ends: 858 [2024-11-09 01:35:48,713 INFO L226 Difference]: Without dead ends: 662 [2024-11-09 01:35:48,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:35:48,714 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 360 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:48,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 790 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 01:35:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-09 01:35:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 541. [2024-11-09 01:35:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 480 states have (on average 1.25625) internal successors, (603), 484 states have internal predecessors, (603), 44 states have call successors, (44), 16 states have call predecessors, (44), 16 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 01:35:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 691 transitions. [2024-11-09 01:35:48,747 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 691 transitions. Word has length 108 [2024-11-09 01:35:48,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:48,748 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 691 transitions. [2024-11-09 01:35:48,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 691 transitions. [2024-11-09 01:35:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:48,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:48,749 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:48,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 01:35:48,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:48,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:48,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:48,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1607597809, now seen corresponding path program 1 times [2024-11-09 01:35:48,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:48,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080633191] [2024-11-09 01:35:48,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:48,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:48,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:48,952 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:48,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 01:35:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:49,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 01:35:49,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:49,215 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 17 treesize of output 9 [2024-11-09 01:35:49,261 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 8 treesize of output 1 [2024-11-09 01:35:49,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-09 01:35:49,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:49,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-11-09 01:35:49,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:49,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 49 [2024-11-09 01:35:50,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:50,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 38 [2024-11-09 01:35:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 136 proven. 15 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 01:35:51,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:52,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:52,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080633191] [2024-11-09 01:35:52,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080633191] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:52,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:35:52,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21 [2024-11-09 01:35:52,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920247002] [2024-11-09 01:35:52,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:52,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:35:52,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:52,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:35:52,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:35:52,423 INFO L87 Difference]: Start difference. First operand 541 states and 691 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:54,552 INFO L93 Difference]: Finished difference Result 1237 states and 1586 transitions. [2024-11-09 01:35:54,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:35:54,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-09 01:35:54,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:54,560 INFO L225 Difference]: With dead ends: 1237 [2024-11-09 01:35:54,561 INFO L226 Difference]: Without dead ends: 699 [2024-11-09 01:35:54,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:35:54,562 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 138 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:54,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 620 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 01:35:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-09 01:35:54,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 570. [2024-11-09 01:35:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 509 states have (on average 1.2514734774066798) internal successors, (637), 513 states have internal predecessors, (637), 44 states have call successors, (44), 16 states have call predecessors, (44), 16 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 01:35:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 725 transitions. [2024-11-09 01:35:54,598 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 725 transitions. Word has length 108 [2024-11-09 01:35:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:54,599 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 725 transitions. [2024-11-09 01:35:54,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 725 transitions. [2024-11-09 01:35:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:54,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:54,600 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:54,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 01:35:54,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:54,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:54,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:54,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1865763247, now seen corresponding path program 1 times [2024-11-09 01:35:54,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:54,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429945488] [2024-11-09 01:35:54,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:54,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:35:54,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:54,808 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:35:54,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 01:35:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:55,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 01:35:55,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:55,084 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 17 treesize of output 9 [2024-11-09 01:35:55,127 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 8 treesize of output 1 [2024-11-09 01:35:55,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 01:35:55,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-09 01:35:55,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:55,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 50 [2024-11-09 01:35:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 144 proven. 15 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-09 01:35:55,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:57,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:57,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429945488] [2024-11-09 01:35:57,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429945488] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:57,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:35:57,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2024-11-09 01:35:57,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869327998] [2024-11-09 01:35:57,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:57,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:35:57,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:57,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:35:57,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:35:57,359 INFO L87 Difference]: Start difference. First operand 570 states and 725 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:59,815 INFO L93 Difference]: Finished difference Result 1253 states and 1598 transitions. [2024-11-09 01:35:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:35:59,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-09 01:35:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:59,821 INFO L225 Difference]: With dead ends: 1253 [2024-11-09 01:35:59,821 INFO L226 Difference]: Without dead ends: 686 [2024-11-09 01:35:59,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:35:59,823 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 229 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:59,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 688 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 01:35:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-09 01:35:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 557. [2024-11-09 01:35:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 496 states have (on average 1.2540322580645162) internal successors, (622), 500 states have internal predecessors, (622), 44 states have call successors, (44), 16 states have call predecessors, (44), 16 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 01:35:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 710 transitions. [2024-11-09 01:35:59,860 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 710 transitions. Word has length 108 [2024-11-09 01:35:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:59,860 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 710 transitions. [2024-11-09 01:35:59,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 710 transitions. [2024-11-09 01:35:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:35:59,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:59,861 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:59,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 01:36:00,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:00,063 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:00,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:00,063 INFO L85 PathProgramCache]: Analyzing trace with hash 694939198, now seen corresponding path program 1 times [2024-11-09 01:36:00,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:00,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222185813] [2024-11-09 01:36:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:00,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:00,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:00,067 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:00,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 01:36:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:00,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 01:36:00,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:00,338 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 17 treesize of output 9 [2024-11-09 01:36:00,392 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 14 treesize of output 10 [2024-11-09 01:36:00,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:36:00,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:00,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 37 [2024-11-09 01:36:00,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:00,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 27 [2024-11-09 01:36:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-09 01:36:00,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:00,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:00,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222185813] [2024-11-09 01:36:00,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222185813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:00,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:00,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:36:00,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485238731] [2024-11-09 01:36:00,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:00,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:36:00,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:00,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:36:00,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:36:00,958 INFO L87 Difference]: Start difference. First operand 557 states and 710 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:02,810 INFO L93 Difference]: Finished difference Result 1306 states and 1653 transitions. [2024-11-09 01:36:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:36:02,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-09 01:36:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:02,814 INFO L225 Difference]: With dead ends: 1306 [2024-11-09 01:36:02,814 INFO L226 Difference]: Without dead ends: 752 [2024-11-09 01:36:02,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:36:02,816 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 354 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:02,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 826 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 01:36:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-11-09 01:36:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 629. [2024-11-09 01:36:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 558 states have (on average 1.2508960573476702) internal successors, (698), 563 states have internal predecessors, (698), 51 states have call successors, (51), 19 states have call predecessors, (51), 19 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-09 01:36:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 800 transitions. [2024-11-09 01:36:02,862 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 800 transitions. Word has length 109 [2024-11-09 01:36:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:02,863 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 800 transitions. [2024-11-09 01:36:02,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:02,863 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 800 transitions. [2024-11-09 01:36:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:36:02,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:02,864 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:02,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 01:36:03,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:03,065 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:03,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:03,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1917051433, now seen corresponding path program 1 times [2024-11-09 01:36:03,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:03,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428907764] [2024-11-09 01:36:03,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:03,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:03,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:03,067 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:03,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 01:36:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 01:36:03,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:03,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:36:03,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-09 01:36:03,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:03,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2024-11-09 01:36:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 01:36:03,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:03,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:03,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428907764] [2024-11-09 01:36:03,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428907764] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:03,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:36:03,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2024-11-09 01:36:03,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885004728] [2024-11-09 01:36:03,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:03,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:36:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:03,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:36:03,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:36:03,693 INFO L87 Difference]: Start difference. First operand 629 states and 800 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:03,781 INFO L93 Difference]: Finished difference Result 652 states and 829 transitions. [2024-11-09 01:36:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:36:03,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-09 01:36:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:03,784 INFO L225 Difference]: With dead ends: 652 [2024-11-09 01:36:03,784 INFO L226 Difference]: Without dead ends: 650 [2024-11-09 01:36:03,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:36:03,786 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 24 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:03,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 492 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-09 01:36:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2024-11-09 01:36:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 579 states have (on average 1.241796200345423) internal successors, (719), 584 states have internal predecessors, (719), 51 states have call successors, (51), 19 states have call predecessors, (51), 19 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-09 01:36:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 821 transitions. [2024-11-09 01:36:03,821 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 821 transitions. Word has length 109 [2024-11-09 01:36:03,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:03,822 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 821 transitions. [2024-11-09 01:36:03,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 821 transitions. [2024-11-09 01:36:03,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:36:03,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:03,827 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:03,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 01:36:04,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:04,027 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:04,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1918898475, now seen corresponding path program 1 times [2024-11-09 01:36:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:04,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732060855] [2024-11-09 01:36:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:04,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:04,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:04,031 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:04,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 01:36:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:04,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:36:04,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:04,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:04,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:04,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732060855] [2024-11-09 01:36:04,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732060855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:04,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:04,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:36:04,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039163457] [2024-11-09 01:36:04,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:04,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:36:04,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:04,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:36:04,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:36:04,239 INFO L87 Difference]: Start difference. First operand 650 states and 821 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:04,280 INFO L93 Difference]: Finished difference Result 1318 states and 1667 transitions. [2024-11-09 01:36:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:36:04,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-09 01:36:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:04,284 INFO L225 Difference]: With dead ends: 1318 [2024-11-09 01:36:04,284 INFO L226 Difference]: Without dead ends: 671 [2024-11-09 01:36:04,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:36:04,285 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:04,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 429 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-11-09 01:36:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2024-11-09 01:36:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 600 states have (on average 1.2333333333333334) internal successors, (740), 605 states have internal predecessors, (740), 51 states have call successors, (51), 19 states have call predecessors, (51), 19 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-09 01:36:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 842 transitions. [2024-11-09 01:36:04,330 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 842 transitions. Word has length 109 [2024-11-09 01:36:04,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:04,331 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 842 transitions. [2024-11-09 01:36:04,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 842 transitions. [2024-11-09 01:36:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:36:04,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:04,332 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:04,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-09 01:36:04,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:04,533 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:04,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:04,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2079437758, now seen corresponding path program 1 times [2024-11-09 01:36:04,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:04,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885428247] [2024-11-09 01:36:04,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:04,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:04,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:04,535 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:04,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 01:36:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:04,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 01:36:04,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:04,827 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 17 treesize of output 9 [2024-11-09 01:36:04,883 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 8 treesize of output 1 [2024-11-09 01:36:04,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 01:36:05,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:05,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-09 01:36:05,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:05,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 51 [2024-11-09 01:36:05,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:05,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 40 [2024-11-09 01:36:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 141 proven. 21 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-09 01:36:09,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:10,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:10,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885428247] [2024-11-09 01:36:10,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885428247] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:10,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:36:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 24 [2024-11-09 01:36:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899021900] [2024-11-09 01:36:10,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:10,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:36:10,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:10,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:36:10,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:36:10,857 INFO L87 Difference]: Start difference. First operand 671 states and 842 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:13,168 INFO L93 Difference]: Finished difference Result 1421 states and 1782 transitions. [2024-11-09 01:36:13,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:36:13,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-09 01:36:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:13,175 INFO L225 Difference]: With dead ends: 1421 [2024-11-09 01:36:13,175 INFO L226 Difference]: Without dead ends: 753 [2024-11-09 01:36:13,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-11-09 01:36:13,177 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 77 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:13,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 532 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 01:36:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-09 01:36:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 673. [2024-11-09 01:36:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 602 states have (on average 1.2325581395348837) internal successors, (742), 607 states have internal predecessors, (742), 51 states have call successors, (51), 19 states have call predecessors, (51), 19 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-09 01:36:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 844 transitions. [2024-11-09 01:36:13,224 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 844 transitions. Word has length 109 [2024-11-09 01:36:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:13,224 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 844 transitions. [2024-11-09 01:36:13,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 844 transitions. [2024-11-09 01:36:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:36:13,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:13,226 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:13,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-09 01:36:13,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:13,427 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:13,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:13,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1204412288, now seen corresponding path program 1 times [2024-11-09 01:36:13,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:13,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211420109] [2024-11-09 01:36:13,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:13,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:13,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:13,429 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:13,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 01:36:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:13,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:36:13,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:13,739 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 17 treesize of output 9 [2024-11-09 01:36:13,780 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 8 treesize of output 1 [2024-11-09 01:36:13,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-09 01:36:13,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:13,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-11-09 01:36:14,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:14,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-09 01:36:14,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:14,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 15 [2024-11-09 01:36:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 136 proven. 15 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 01:36:14,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:14,246 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:14,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:14,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211420109] [2024-11-09 01:36:14,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211420109] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:14,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:36:14,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-09 01:36:14,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757613367] [2024-11-09 01:36:14,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:14,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:36:14,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:14,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:36:14,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:36:14,247 INFO L87 Difference]: Start difference. First operand 673 states and 844 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:14,624 INFO L93 Difference]: Finished difference Result 1401 states and 1753 transitions. [2024-11-09 01:36:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:36:14,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-09 01:36:14,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:14,627 INFO L225 Difference]: With dead ends: 1401 [2024-11-09 01:36:14,627 INFO L226 Difference]: Without dead ends: 731 [2024-11-09 01:36:14,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:36:14,629 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 35 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:14,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 417 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:36:14,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-09 01:36:14,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 671. [2024-11-09 01:36:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 600 states have (on average 1.2216666666666667) internal successors, (733), 605 states have internal predecessors, (733), 51 states have call successors, (51), 19 states have call predecessors, (51), 19 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-09 01:36:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 835 transitions. [2024-11-09 01:36:14,665 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 835 transitions. Word has length 109 [2024-11-09 01:36:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:14,666 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 835 transitions. [2024-11-09 01:36:14,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 835 transitions. [2024-11-09 01:36:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:36:14,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:14,667 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:14,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-09 01:36:14,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:14,868 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:14,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:14,868 INFO L85 PathProgramCache]: Analyzing trace with hash -454907722, now seen corresponding path program 1 times [2024-11-09 01:36:14,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:14,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806139486] [2024-11-09 01:36:14,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:14,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:14,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:14,870 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:14,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 01:36:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:15,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 01:36:15,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:15,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:36:15,140 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 14 treesize of output 10 [2024-11-09 01:36:15,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-09 01:36:15,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:15,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 32 [2024-11-09 01:36:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 01:36:15,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:15,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:15,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806139486] [2024-11-09 01:36:15,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806139486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:15,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:15,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:36:15,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607111433] [2024-11-09 01:36:15,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:15,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:36:15,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:15,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:36:15,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:36:15,310 INFO L87 Difference]: Start difference. First operand 671 states and 835 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:16,036 INFO L93 Difference]: Finished difference Result 1411 states and 1757 transitions. [2024-11-09 01:36:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:36:16,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-09 01:36:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:16,039 INFO L225 Difference]: With dead ends: 1411 [2024-11-09 01:36:16,039 INFO L226 Difference]: Without dead ends: 743 [2024-11-09 01:36:16,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:36:16,040 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 173 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:16,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 783 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:36:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-11-09 01:36:16,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 630. [2024-11-09 01:36:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 562 states have (on average 1.209964412811388) internal successors, (680), 566 states have internal predecessors, (680), 48 states have call successors, (48), 19 states have call predecessors, (48), 19 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 01:36:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 776 transitions. [2024-11-09 01:36:16,076 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 776 transitions. Word has length 110 [2024-11-09 01:36:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:16,076 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 776 transitions. [2024-11-09 01:36:16,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 776 transitions. [2024-11-09 01:36:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:36:16,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:16,077 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:16,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:16,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:16,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:16,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:16,278 INFO L85 PathProgramCache]: Analyzing trace with hash 246156856, now seen corresponding path program 1 times [2024-11-09 01:36:16,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:16,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978384801] [2024-11-09 01:36:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:16,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:16,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:16,280 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:16,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-09 01:36:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:16,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:36:16,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:17,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:17,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 303 treesize of output 99 [2024-11-09 01:36:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 01:36:17,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:17,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:17,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978384801] [2024-11-09 01:36:17,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978384801] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:17,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:36:17,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-09 01:36:17,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708284457] [2024-11-09 01:36:17,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:17,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:36:17,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:36:17,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:36:17,940 INFO L87 Difference]: Start difference. First operand 630 states and 776 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:18,299 INFO L93 Difference]: Finished difference Result 1257 states and 1547 transitions. [2024-11-09 01:36:18,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:36:18,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-09 01:36:18,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:18,303 INFO L225 Difference]: With dead ends: 1257 [2024-11-09 01:36:18,303 INFO L226 Difference]: Without dead ends: 630 [2024-11-09 01:36:18,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:36:18,304 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 35 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:18,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 495 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:36:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-09 01:36:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 618. [2024-11-09 01:36:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 550 states have (on average 1.2072727272727273) internal successors, (664), 554 states have internal predecessors, (664), 48 states have call successors, (48), 19 states have call predecessors, (48), 19 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 01:36:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 760 transitions. [2024-11-09 01:36:18,346 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 760 transitions. Word has length 110 [2024-11-09 01:36:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:18,346 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 760 transitions. [2024-11-09 01:36:18,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 760 transitions. [2024-11-09 01:36:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:36:18,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:18,348 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:18,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-09 01:36:18,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:18,548 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:18,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash -392868108, now seen corresponding path program 1 times [2024-11-09 01:36:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:18,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540306951] [2024-11-09 01:36:18,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:18,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:18,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:18,550 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:18,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 01:36:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:18,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:36:18,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:19,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:19,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 304 treesize of output 100 [2024-11-09 01:36:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 01:36:19,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:19,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:19,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540306951] [2024-11-09 01:36:19,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540306951] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:19,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:36:19,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-09 01:36:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829850559] [2024-11-09 01:36:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:19,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:36:19,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:36:19,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:36:19,993 INFO L87 Difference]: Start difference. First operand 618 states and 760 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:20,297 INFO L93 Difference]: Finished difference Result 1304 states and 1600 transitions. [2024-11-09 01:36:20,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:36:20,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-09 01:36:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:20,301 INFO L225 Difference]: With dead ends: 1304 [2024-11-09 01:36:20,301 INFO L226 Difference]: Without dead ends: 689 [2024-11-09 01:36:20,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:36:20,303 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 72 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:20,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 369 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:36:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-11-09 01:36:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 619. [2024-11-09 01:36:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 551 states have (on average 1.2032667876588021) internal successors, (663), 555 states have internal predecessors, (663), 48 states have call successors, (48), 19 states have call predecessors, (48), 19 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 01:36:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 759 transitions. [2024-11-09 01:36:20,337 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 759 transitions. Word has length 110 [2024-11-09 01:36:20,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:20,337 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 759 transitions. [2024-11-09 01:36:20,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 759 transitions. [2024-11-09 01:36:20,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:36:20,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:20,338 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:20,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-09 01:36:20,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:20,539 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:20,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash 308196470, now seen corresponding path program 1 times [2024-11-09 01:36:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:20,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709434250] [2024-11-09 01:36:20,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:20,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:20,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:20,541 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:20,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-09 01:36:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:20,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:36:20,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:20,817 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 8 treesize of output 1 [2024-11-09 01:36:20,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:36:20,823 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 14 treesize of output 10 [2024-11-09 01:36:20,859 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 17 treesize of output 13 [2024-11-09 01:36:20,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:20,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2024-11-09 01:36:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 01:36:20,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:20,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:20,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709434250] [2024-11-09 01:36:20,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709434250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:20,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:20,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:36:20,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972769481] [2024-11-09 01:36:20,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:20,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:36:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:20,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:36:20,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:36:20,967 INFO L87 Difference]: Start difference. First operand 619 states and 759 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:21,598 INFO L93 Difference]: Finished difference Result 1238 states and 1518 transitions. [2024-11-09 01:36:21,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:36:21,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-09 01:36:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:21,601 INFO L225 Difference]: With dead ends: 1238 [2024-11-09 01:36:21,601 INFO L226 Difference]: Without dead ends: 622 [2024-11-09 01:36:21,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:36:21,602 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 191 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:21,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 685 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:36:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-09 01:36:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 613. [2024-11-09 01:36:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 545 states have (on average 1.201834862385321) internal successors, (655), 549 states have internal predecessors, (655), 48 states have call successors, (48), 19 states have call predecessors, (48), 19 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 01:36:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 751 transitions. [2024-11-09 01:36:21,641 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 751 transitions. Word has length 110 [2024-11-09 01:36:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:21,641 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 751 transitions. [2024-11-09 01:36:21,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 751 transitions. [2024-11-09 01:36:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:36:21,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:21,643 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:21,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-09 01:36:21,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:21,843 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:21,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash -90570928, now seen corresponding path program 1 times [2024-11-09 01:36:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:21,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74331373] [2024-11-09 01:36:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:21,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:21,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:21,845 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:21,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-09 01:36:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:22,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:36:22,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:27,163 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 136 treesize of output 88 [2024-11-09 01:36:27,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:27,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 40 [2024-11-09 01:36:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-09 01:36:27,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:27,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:27,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74331373] [2024-11-09 01:36:27,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74331373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:27,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:27,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:36:27,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063179069] [2024-11-09 01:36:27,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:27,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:36:27,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:27,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:36:27,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:36:27,970 INFO L87 Difference]: Start difference. First operand 613 states and 751 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:34,384 INFO L93 Difference]: Finished difference Result 1909 states and 2306 transitions. [2024-11-09 01:36:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:36:34,385 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-11-09 01:36:34,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:34,388 INFO L225 Difference]: With dead ends: 1909 [2024-11-09 01:36:34,388 INFO L226 Difference]: Without dead ends: 1299 [2024-11-09 01:36:34,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:36:34,389 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 246 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:34,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 719 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-09 01:36:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2024-11-09 01:36:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1250. [2024-11-09 01:36:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1115 states have (on average 1.1748878923766817) internal successors, (1310), 1129 states have internal predecessors, (1310), 96 states have call successors, (96), 38 states have call predecessors, (96), 38 states have return successors, (96), 82 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 01:36:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1502 transitions. [2024-11-09 01:36:34,470 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1502 transitions. Word has length 111 [2024-11-09 01:36:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:34,471 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1502 transitions. [2024-11-09 01:36:34,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1502 transitions. [2024-11-09 01:36:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:36:34,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:34,472 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:34,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-09 01:36:34,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:34,673 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:34,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2127059470, now seen corresponding path program 1 times [2024-11-09 01:36:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:34,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261322939] [2024-11-09 01:36:34,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:34,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:34,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:34,675 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:34,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-09 01:36:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:34,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:36:34,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-09 01:36:34,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:34,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261322939] [2024-11-09 01:36:34,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261322939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:34,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:34,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:36:34,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002484974] [2024-11-09 01:36:34,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:34,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:36:34,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:34,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:36:34,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:36:34,885 INFO L87 Difference]: Start difference. First operand 1250 states and 1502 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:34,977 INFO L93 Difference]: Finished difference Result 2497 states and 3001 transitions. [2024-11-09 01:36:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:36:34,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-11-09 01:36:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:34,981 INFO L225 Difference]: With dead ends: 2497 [2024-11-09 01:36:34,981 INFO L226 Difference]: Without dead ends: 1250 [2024-11-09 01:36:34,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:36:34,983 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:34,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-09 01:36:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2024-11-09 01:36:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1115 states have (on average 1.169506726457399) internal successors, (1304), 1129 states have internal predecessors, (1304), 96 states have call successors, (96), 38 states have call predecessors, (96), 38 states have return successors, (96), 82 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 01:36:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1496 transitions. [2024-11-09 01:36:35,054 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1496 transitions. Word has length 111 [2024-11-09 01:36:35,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:35,055 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1496 transitions. [2024-11-09 01:36:35,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1496 transitions. [2024-11-09 01:36:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 01:36:35,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:35,056 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:35,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:35,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:35,257 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:35,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:35,258 INFO L85 PathProgramCache]: Analyzing trace with hash 909567505, now seen corresponding path program 1 times [2024-11-09 01:36:35,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:35,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562587854] [2024-11-09 01:36:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:35,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:35,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:35,262 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:35,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-09 01:36:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:35,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 01:36:35,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:35,515 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 17 treesize of output 13 [2024-11-09 01:36:35,560 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 54 treesize of output 42 [2024-11-09 01:36:35,565 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 14 treesize of output 10 [2024-11-09 01:36:35,740 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 64 treesize of output 44 [2024-11-09 01:36:36,016 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 53 treesize of output 41 [2024-11-09 01:36:36,020 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 52 treesize of output 40 [2024-11-09 01:36:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:36,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:36,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:36,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562587854] [2024-11-09 01:36:36,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562587854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:36,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:36,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 01:36:36,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257577616] [2024-11-09 01:36:36,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:36,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 01:36:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:36,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 01:36:36,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:36:36,138 INFO L87 Difference]: Start difference. First operand 1250 states and 1496 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:38,659 INFO L93 Difference]: Finished difference Result 2147 states and 2552 transitions. [2024-11-09 01:36:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:36:38,660 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-09 01:36:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:38,669 INFO L225 Difference]: With dead ends: 2147 [2024-11-09 01:36:38,669 INFO L226 Difference]: Without dead ends: 1580 [2024-11-09 01:36:38,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:36:38,670 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 253 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:38,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 2233 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 01:36:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-09 01:36:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1388. [2024-11-09 01:36:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1253 states have (on average 1.1588188347964885) internal successors, (1452), 1267 states have internal predecessors, (1452), 96 states have call successors, (96), 38 states have call predecessors, (96), 38 states have return successors, (96), 82 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 01:36:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1644 transitions. [2024-11-09 01:36:38,748 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1644 transitions. Word has length 112 [2024-11-09 01:36:38,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:38,748 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1644 transitions. [2024-11-09 01:36:38,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1644 transitions. [2024-11-09 01:36:38,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 01:36:38,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:38,750 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:38,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:38,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:38,952 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:38,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:38,953 INFO L85 PathProgramCache]: Analyzing trace with hash 971607119, now seen corresponding path program 1 times [2024-11-09 01:36:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:38,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894049073] [2024-11-09 01:36:38,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:38,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:38,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:38,956 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:38,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-09 01:36:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:39,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 01:36:39,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:39,204 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 17 treesize of output 13 [2024-11-09 01:36:39,215 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 29 treesize of output 21 [2024-11-09 01:36:39,561 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 22 treesize of output 14 [2024-11-09 01:36:39,564 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 52 treesize of output 28 [2024-11-09 01:36:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:39,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:39,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:39,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894049073] [2024-11-09 01:36:39,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894049073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:39,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:39,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:36:39,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699653458] [2024-11-09 01:36:39,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:39,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:36:39,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:39,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:36:39,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:36:39,625 INFO L87 Difference]: Start difference. First operand 1388 states and 1644 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:41,727 INFO L93 Difference]: Finished difference Result 2305 states and 2724 transitions. [2024-11-09 01:36:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:36:41,728 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-09 01:36:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:41,733 INFO L225 Difference]: With dead ends: 2305 [2024-11-09 01:36:41,733 INFO L226 Difference]: Without dead ends: 1620 [2024-11-09 01:36:41,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:36:41,734 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 195 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:41,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1572 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 607 Invalid, 3 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 01:36:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2024-11-09 01:36:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1446. [2024-11-09 01:36:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1311 states have (on average 1.1540808543096872) internal successors, (1513), 1325 states have internal predecessors, (1513), 96 states have call successors, (96), 38 states have call predecessors, (96), 38 states have return successors, (96), 82 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 01:36:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1705 transitions. [2024-11-09 01:36:41,824 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1705 transitions. Word has length 112 [2024-11-09 01:36:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:41,825 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 1705 transitions. [2024-11-09 01:36:41,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1705 transitions. [2024-11-09 01:36:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 01:36:41,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:41,828 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:41,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-09 01:36:42,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:42,032 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:42,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:42,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1651665489, now seen corresponding path program 1 times [2024-11-09 01:36:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:42,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390513488] [2024-11-09 01:36:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:42,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:42,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:42,036 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:36:42,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-09 01:36:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:42,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 01:36:42,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:42,589 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 17 treesize of output 13 [2024-11-09 01:36:42,679 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 71 treesize of output 55 [2024-11-09 01:36:42,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-09 01:36:42,884 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 65 treesize of output 45 [2024-11-09 01:36:43,299 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 53 treesize of output 41 [2024-11-09 01:36:43,304 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 52 treesize of output 40 [2024-11-09 01:36:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:43,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:43,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:43,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390513488] [2024-11-09 01:36:43,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390513488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:43,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:43,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 01:36:43,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427645509] [2024-11-09 01:36:43,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:43,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 01:36:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 01:36:43,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:36:43,475 INFO L87 Difference]: Start difference. First operand 1446 states and 1705 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)