./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.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-49.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 6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:31:33,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:31:33,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:31:33,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:31:33,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:31:33,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:31:33,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:31:33,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:31:33,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:31:33,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:31:33,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:31:33,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:31:33,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:31:33,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:31:33,913 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:31:33,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:31:33,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:31:33,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:31:33,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:31:33,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:31:33,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:31:33,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:31:33,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:31:33,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:31:33,920 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:31:33,921 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:31:33,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:31:33,921 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:31:33,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:31:33,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:31:33,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:31:33,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:31:33,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:31:33,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:31:33,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:31:33,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:31:33,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:31:33,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:31:33,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:31:33,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:31:33,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:31:33,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:31:33,928 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 -> 6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410 [2024-11-09 01:31:34,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:31:34,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:31:34,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:31:34,220 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:31:34,220 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:31:34,222 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-49.i [2024-11-09 01:31:35,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:31:36,028 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:31:36,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i [2024-11-09 01:31:36,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4d487ff/91dafe52b390476c84e4fb04f84107a6/FLAG934da3a28 [2024-11-09 01:31:36,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4d487ff/91dafe52b390476c84e4fb04f84107a6 [2024-11-09 01:31:36,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:31:36,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:31:36,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:31:36,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:31:36,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:31:36,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:31:36" (1/1) ... [2024-11-09 01:31:36,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1697c3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36, skipping insertion in model container [2024-11-09 01:31:36,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:31:36" (1/1) ... [2024-11-09 01:31:36,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:31:36,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-49.i[916,929] [2024-11-09 01:31:36,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:31:36,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:31:36,715 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-49.i[916,929] [2024-11-09 01:31:36,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:31:36,801 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:31:36,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36 WrapperNode [2024-11-09 01:31:36,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:31:36,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:31:36,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:31:36,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:31:36,809 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:31:36" (1/1) ... [2024-11-09 01:31:36,825 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:31:36" (1/1) ... [2024-11-09 01:31:36,885 INFO L138 Inliner]: procedures = 29, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 662 [2024-11-09 01:31:36,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:31:36,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:31:36,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:31:36,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:31:36,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36" (1/1) ... [2024-11-09 01:31:36,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36" (1/1) ... [2024-11-09 01:31:36,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36" (1/1) ... [2024-11-09 01:31:36,960 INFO L175 MemorySlicer]: Split 166 memory accesses to 5 slices as follows [2, 34, 18, 19, 93]. 56 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 2, 4]. The 17 writes are split as follows [0, 6, 2, 2, 7]. [2024-11-09 01:31:36,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36" (1/1) ... [2024-11-09 01:31:36,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36" (1/1) ... [2024-11-09 01:31:36,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36" (1/1) ... [2024-11-09 01:31:37,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36" (1/1) ... [2024-11-09 01:31:37,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36" (1/1) ... [2024-11-09 01:31:37,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36" (1/1) ... [2024-11-09 01:31:37,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:31:37,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:31:37,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:31:37,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:31:37,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36" (1/1) ... [2024-11-09 01:31:37,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:31:37,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:31:37,074 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:31:37,077 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:31:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:31:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:31:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:31:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:31:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:31:37,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:31:37,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:31:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:31:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:31:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:31:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:31:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:31:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:31:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:31:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:31:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:31:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:31:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:31:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:31:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:31:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:31:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:31:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:31:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:31:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:31:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:31:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:31:37,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:31:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:31:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:31:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:31:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:31:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:31:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:31:37,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:31:37,333 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:31:37,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:31:38,012 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2024-11-09 01:31:38,013 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:31:38,035 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:31:38,036 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:31:38,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:31:38 BoogieIcfgContainer [2024-11-09 01:31:38,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:31:38,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:31:38,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:31:38,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:31:38,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:31:36" (1/3) ... [2024-11-09 01:31:38,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a595765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:31:38, skipping insertion in model container [2024-11-09 01:31:38,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:36" (2/3) ... [2024-11-09 01:31:38,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a595765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:31:38, skipping insertion in model container [2024-11-09 01:31:38,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:31:38" (3/3) ... [2024-11-09 01:31:38,050 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-49.i [2024-11-09 01:31:38,068 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:31:38,068 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:31:38,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:31:38,155 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;@1f80a903, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:31:38,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:31:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 120 states have internal predecessors, (175), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:31:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:31:38,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:38,172 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:38,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:38,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1655919171, now seen corresponding path program 1 times [2024-11-09 01:31:38,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:38,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622124435] [2024-11-09 01:31:38,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:31:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:31:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:31:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:31:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:31:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:31:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:31:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:31:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:31:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:31:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:31:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:31:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:31:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:31:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:31:38,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:31:38,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622124435] [2024-11-09 01:31:38,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622124435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:38,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:38,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:31:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144249405] [2024-11-09 01:31:38,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:38,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:31:38,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:31:38,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:31:38,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:31:38,720 INFO L87 Difference]: Start difference. First operand has 136 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 120 states have internal predecessors, (175), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:31:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:38,758 INFO L93 Difference]: Finished difference Result 265 states and 414 transitions. [2024-11-09 01:31:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:31:38,761 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-09 01:31:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:38,770 INFO L225 Difference]: With dead ends: 265 [2024-11-09 01:31:38,770 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 01:31:38,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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:31:38,776 INFO L432 NwaCegarLoop]: 196 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, 196 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:31:38,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:31:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 01:31:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-09 01:31:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.4482758620689655) internal successors, (168), 116 states have internal predecessors, (168), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:31:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 196 transitions. [2024-11-09 01:31:38,823 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 196 transitions. Word has length 117 [2024-11-09 01:31:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:38,824 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 196 transitions. [2024-11-09 01:31:38,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:31:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 196 transitions. [2024-11-09 01:31:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:31:38,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:38,828 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:38,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:31:38,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:38,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash -358103061, now seen corresponding path program 1 times [2024-11-09 01:31:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:38,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308011094] [2024-11-09 01:31:38,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:38,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:31:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:31:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:31:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:31:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:31:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:31:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:31:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:31:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:31:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:31:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:31:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:31:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:31:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:31:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:31:39,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:31:39,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308011094] [2024-11-09 01:31:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308011094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:39,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:39,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:31:39,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426216493] [2024-11-09 01:31:39,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:39,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:31:39,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:31:39,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:31:39,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:31:39,660 INFO L87 Difference]: Start difference. First operand 132 states and 196 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:40,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:40,062 INFO L93 Difference]: Finished difference Result 392 states and 585 transitions. [2024-11-09 01:31:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:31:40,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-09 01:31:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:40,065 INFO L225 Difference]: With dead ends: 392 [2024-11-09 01:31:40,066 INFO L226 Difference]: Without dead ends: 263 [2024-11-09 01:31:40,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:31:40,073 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 187 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:40,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 882 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:31:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-09 01:31:40,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 136. [2024-11-09 01:31:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 120 states have (on average 1.4416666666666667) internal successors, (173), 120 states have internal predecessors, (173), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:31:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 201 transitions. [2024-11-09 01:31:40,102 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 201 transitions. Word has length 117 [2024-11-09 01:31:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:40,104 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 201 transitions. [2024-11-09 01:31:40,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 201 transitions. [2024-11-09 01:31:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:31:40,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:40,109 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:40,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:31:40,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:40,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:40,112 INFO L85 PathProgramCache]: Analyzing trace with hash 132184262, now seen corresponding path program 1 times [2024-11-09 01:31:40,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:40,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416078324] [2024-11-09 01:31:40,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:40,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:31:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:31:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:31:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:31:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:31:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:31:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:31:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:31:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:31:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:31:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:31:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:31:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:31:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:31:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:31:40,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:31:40,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416078324] [2024-11-09 01:31:40,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416078324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:31:40,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672902374] [2024-11-09 01:31:40,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:40,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:40,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:31:40,930 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:31:40,932 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:31:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:31:41,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:41,282 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 76 treesize of output 55 [2024-11-09 01:31:41,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 28 [2024-11-09 01:31:41,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 30 [2024-11-09 01:31:41,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:41,648 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 80 treesize of output 42 [2024-11-09 01:31:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:31:41,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:31:41,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672902374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:41,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:31:41,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2024-11-09 01:31:41,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579875203] [2024-11-09 01:31:41,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:41,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:31:41,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:31:41,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:31:41,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:31:41,751 INFO L87 Difference]: Start difference. First operand 136 states and 201 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:42,078 INFO L93 Difference]: Finished difference Result 387 states and 574 transitions. [2024-11-09 01:31:42,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:31:42,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-09 01:31:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:42,083 INFO L225 Difference]: With dead ends: 387 [2024-11-09 01:31:42,083 INFO L226 Difference]: Without dead ends: 254 [2024-11-09 01:31:42,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:31:42,088 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 156 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:42,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1452 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:31:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-09 01:31:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2024-11-09 01:31:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 228 states have (on average 1.4605263157894737) internal successors, (333), 229 states have internal predecessors, (333), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:31:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2024-11-09 01:31:42,122 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 119 [2024-11-09 01:31:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:42,125 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2024-11-09 01:31:42,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2024-11-09 01:31:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:31:42,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:42,129 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:42,148 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:31:42,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:42,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:42,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash -260842748, now seen corresponding path program 1 times [2024-11-09 01:31:42,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:42,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810061953] [2024-11-09 01:31:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:31:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:31:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:31:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:31:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:31:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:31:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:31:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:31:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:31:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:31:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:31:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:31:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:31:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:31:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:31:42,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:31:42,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810061953] [2024-11-09 01:31:42,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810061953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:42,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:42,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:31:42,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379030145] [2024-11-09 01:31:42,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:42,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:31:42,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:31:42,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:31:42,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:31:42,799 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:42,910 INFO L93 Difference]: Finished difference Result 528 states and 782 transitions. [2024-11-09 01:31:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:31:42,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-09 01:31:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:42,915 INFO L225 Difference]: With dead ends: 528 [2024-11-09 01:31:42,915 INFO L226 Difference]: Without dead ends: 280 [2024-11-09 01:31:42,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:31:42,917 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 154 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:42,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 694 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:31:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-09 01:31:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 250. [2024-11-09 01:31:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 227 states have (on average 1.4581497797356828) internal successors, (331), 228 states have internal predecessors, (331), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:31:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2024-11-09 01:31:42,932 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 119 [2024-11-09 01:31:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:42,933 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2024-11-09 01:31:42,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2024-11-09 01:31:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:31:42,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:42,935 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:42,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:31:42,935 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:42,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:42,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1402700193, now seen corresponding path program 1 times [2024-11-09 01:31:42,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:42,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902617667] [2024-11-09 01:31:42,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:42,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:31:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:31:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:31:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:31:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:31:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:31:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:31:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:31:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:31:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:31:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:31:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:31:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:31:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:31:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:31:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:31:43,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902617667] [2024-11-09 01:31:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902617667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:31:43,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843026974] [2024-11-09 01:31:43,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:43,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:43,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:31:43,503 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:31:43,506 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:31:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:43,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:31:43,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:43,858 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:31:44,095 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 68 treesize of output 50 [2024-11-09 01:31:44,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:44,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 80 [2024-11-09 01:31:44,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:44,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 40 [2024-11-09 01:31:44,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:44,183 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 70 treesize of output 34 [2024-11-09 01:31:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-09 01:31:44,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:31:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:31:44,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843026974] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:31:44,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:31:44,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 11 [2024-11-09 01:31:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674850658] [2024-11-09 01:31:44,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:31:44,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:31:44,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:31:44,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:31:44,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:31:44,506 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-09 01:31:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:44,897 INFO L93 Difference]: Finished difference Result 677 states and 1001 transitions. [2024-11-09 01:31:44,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:31:44,898 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) Word has length 119 [2024-11-09 01:31:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:44,901 INFO L225 Difference]: With dead ends: 677 [2024-11-09 01:31:44,901 INFO L226 Difference]: Without dead ends: 430 [2024-11-09 01:31:44,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 259 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:31:44,902 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 744 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:44,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 889 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:31:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-09 01:31:44,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 258. [2024-11-09 01:31:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 233 states have (on average 1.4377682403433476) internal successors, (335), 234 states have internal predecessors, (335), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:31:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 375 transitions. [2024-11-09 01:31:44,923 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 375 transitions. Word has length 119 [2024-11-09 01:31:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:44,924 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 375 transitions. [2024-11-09 01:31:44,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-09 01:31:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 375 transitions. [2024-11-09 01:31:44,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:31:44,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:44,927 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:44,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:31:45,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:45,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:45,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:45,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1086473895, now seen corresponding path program 1 times [2024-11-09 01:31:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268849065] [2024-11-09 01:31:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:45,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:31:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:31:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:31:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:31:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:31:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:31:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:31:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:31:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:31:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:31:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:31:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:31:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:31:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:31:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:31:45,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:31:45,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268849065] [2024-11-09 01:31:45,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268849065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:31:45,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336381520] [2024-11-09 01:31:45,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:45,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:45,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:31:45,724 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:31:45,726 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:31:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:45,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 01:31:45,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:46,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2024-11-09 01:31:46,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2024-11-09 01:31:46,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2024-11-09 01:31:46,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:46,225 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 36 [2024-11-09 01:31:46,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:46,273 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 45 treesize of output 15 [2024-11-09 01:31:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 106 proven. 66 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-09 01:31:46,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:31:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:31:46,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336381520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:31:46,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:31:46,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 13 [2024-11-09 01:31:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129475990] [2024-11-09 01:31:46,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:31:46,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:31:46,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:31:46,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:31:46,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:31:46,558 INFO L87 Difference]: Start difference. First operand 258 states and 375 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, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-09 01:31:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:47,517 INFO L93 Difference]: Finished difference Result 1172 states and 1687 transitions. [2024-11-09 01:31:47,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 01:31:47,519 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, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 4 states have call successors, (26) Word has length 121 [2024-11-09 01:31:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:47,525 INFO L225 Difference]: With dead ends: 1172 [2024-11-09 01:31:47,526 INFO L226 Difference]: Without dead ends: 917 [2024-11-09 01:31:47,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 261 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 01:31:47,529 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1103 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:47,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1309 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:31:47,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-09 01:31:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 274. [2024-11-09 01:31:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 247 states have (on average 1.4291497975708503) internal successors, (353), 248 states have internal predecessors, (353), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:31:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 393 transitions. [2024-11-09 01:31:47,563 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 393 transitions. Word has length 121 [2024-11-09 01:31:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:47,564 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 393 transitions. [2024-11-09 01:31:47,564 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, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-09 01:31:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 393 transitions. [2024-11-09 01:31:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:31:47,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:47,567 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:47,586 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:31:47,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:47,768 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:47,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1673279909, now seen corresponding path program 1 times [2024-11-09 01:31:47,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:47,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051929556] [2024-11-09 01:31:47,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:31:47,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:31:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:31:47,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:31:47,952 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:31:47,953 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:31:47,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:31:47,958 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:31:48,046 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:31:48,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:31:48 BoogieIcfgContainer [2024-11-09 01:31:48,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:31:48,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:31:48,052 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:31:48,052 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:31:48,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:31:38" (3/4) ... [2024-11-09 01:31:48,055 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:31:48,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:31:48,057 INFO L158 Benchmark]: Toolchain (without parser) took 11667.96ms. Allocated memory was 172.0MB in the beginning and 333.4MB in the end (delta: 161.5MB). Free memory was 115.8MB in the beginning and 188.9MB in the end (delta: -73.2MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2024-11-09 01:31:48,057 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:31:48,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.31ms. Allocated memory is still 172.0MB. Free memory was 115.4MB in the beginning and 96.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 01:31:48,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.87ms. Allocated memory is still 172.0MB. Free memory was 96.5MB in the beginning and 91.0MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:31:48,058 INFO L158 Benchmark]: Boogie Preprocessor took 132.64ms. Allocated memory is still 172.0MB. Free memory was 91.0MB in the beginning and 84.3MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:31:48,058 INFO L158 Benchmark]: RCFGBuilder took 1017.11ms. Allocated memory was 172.0MB in the beginning and 230.7MB in the end (delta: 58.7MB). Free memory was 84.0MB in the beginning and 173.2MB in the end (delta: -89.2MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-11-09 01:31:48,058 INFO L158 Benchmark]: TraceAbstraction took 10012.94ms. Allocated memory was 230.7MB in the beginning and 333.4MB in the end (delta: 102.8MB). Free memory was 172.2MB in the beginning and 188.9MB in the end (delta: -16.7MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2024-11-09 01:31:48,059 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 333.4MB. Free memory is still 188.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:31:48,060 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.20ms. Allocated memory is still 172.0MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.31ms. Allocated memory is still 172.0MB. Free memory was 115.4MB in the beginning and 96.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.87ms. Allocated memory is still 172.0MB. Free memory was 96.5MB in the beginning and 91.0MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.64ms. Allocated memory is still 172.0MB. Free memory was 91.0MB in the beginning and 84.3MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1017.11ms. Allocated memory was 172.0MB in the beginning and 230.7MB in the end (delta: 58.7MB). Free memory was 84.0MB in the beginning and 173.2MB in the end (delta: -89.2MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10012.94ms. Allocated memory was 230.7MB in the beginning and 333.4MB in the end (delta: 102.8MB). Free memory was 172.2MB in the beginning and 188.9MB in the end (delta: -16.7MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 333.4MB. Free memory is still 188.9MB. There was no memory consumed. 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 someBinaryFLOATComparisonOperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L25-L27] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L25-L27] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L25-L27] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] float_Array_0[0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] 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}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] 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}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] 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, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] 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}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] float_Array_0[1] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L76] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] unsigned_short_int_Array_0[0][0] = __VERIFIER_nondet_ushort() [L79] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L82] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L99] RET updateVariables() [L100] CALL step() [L37] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR ((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]) [L37] EXPR signed_short_int_Array_0[0] [L37] EXPR ((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] signed_short_int_Array_0[1] = ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))) [L38] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L38] EXPR 50 >> unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L38] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L38] COND FALSE !((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) [L41] EXPR BOOL_unsigned_char_Array_0[1][1] [L41] BOOL_unsigned_char_Array_0[0][1] = (! BOOL_unsigned_char_Array_0[1][1]) [L43] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L43] COND TRUE ! BOOL_unsigned_char_Array_0[0][0] [L44] EXPR unsigned_short_int_Array_0[0][1] [L44] EXPR unsigned_short_int_Array_0[0][0] [L44] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L44] EXPR ((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1]) [L44] EXPR unsigned_short_int_Array_0[0][0] [L44] EXPR ((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L44] COND FALSE !(unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) [L47] EXPR BOOL_unsigned_char_Array_0[1][1] [L47] BOOL_unsigned_char_Array_0[1][0] = BOOL_unsigned_char_Array_0[1][1] [L50] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L50] COND TRUE float_Array_0[1] >= 64.5f [L51] EXPR float_Array_0[1] [L51] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L51] COND FALSE !(float_Array_0[1] >= float_Array_0[0]) [L54] BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[1][0]) [L57] EXPR unsigned_short_int_Array_0[0][0] [L57] unsigned_short_int_Array_0[1][1] = unsigned_short_int_Array_0[0][0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR (float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50)) [L91] EXPR unsigned_short_int_Array_0[1][1] [L91] EXPR (float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR (((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR (((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))))) && ((! BOOL_unsigned_char_Array_0[0][0]) ? ((unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))))) && ((! BOOL_unsigned_char_Array_0[0][0]) ? ((unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91-L92] return ((((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))))) && ((! BOOL_unsigned_char_Array_0[0][0]) ? ((unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : 1) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 7, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2353 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2344 mSDsluCounter, 5422 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4196 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1406 IncrementalHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 1226 mSDtfsCounter, 1406 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 853 GetRequests, 770 SyntacticMatches, 11 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=6, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 975 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1192 NumberOfCodeBlocks, 1192 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1300 ConstructedInterpolants, 0 QuantifiedInterpolants, 5797 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1205 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 3734/4004 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:31:48,095 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-49.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 6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:31:50,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:31:50,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:31:50,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:31:50,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:31:50,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:31:50,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:31:50,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:31:50,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:31:50,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:31:50,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:31:50,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:31:50,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:31:50,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:31:50,618 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:31:50,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:31:50,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:31:50,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:31:50,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:31:50,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:31:50,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:31:50,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:31:50,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:31:50,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:31:50,625 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:31:50,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:31:50,626 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:31:50,626 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:31:50,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:31:50,627 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:31:50,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:31:50,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:31:50,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:31:50,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:31:50,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:31:50,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:31:50,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:31:50,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:31:50,634 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:31:50,635 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:31:50,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:31:50,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:31:50,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:31:50,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:31:50,636 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 -> 6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410 [2024-11-09 01:31:50,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:31:51,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:31:51,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:31:51,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:31:51,024 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:31:51,026 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-49.i [2024-11-09 01:31:52,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:31:52,944 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:31:52,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i [2024-11-09 01:31:52,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea85c75a9/e84c5cc06278475d8498a8c4bbf50ecb/FLAG6ef9780a2 [2024-11-09 01:31:53,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea85c75a9/e84c5cc06278475d8498a8c4bbf50ecb [2024-11-09 01:31:53,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:31:53,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:31:53,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:31:53,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:31:53,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:31:53,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e694afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53, skipping insertion in model container [2024-11-09 01:31:53,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:31:53,484 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-49.i[916,929] [2024-11-09 01:31:53,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:31:53,626 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:31:53,639 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-49.i[916,929] [2024-11-09 01:31:53,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:31:53,757 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:31:53,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53 WrapperNode [2024-11-09 01:31:53,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:31:53,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:31:53,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:31:53,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:31:53,766 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:31:53" (1/1) ... [2024-11-09 01:31:53,796 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:31:53" (1/1) ... [2024-11-09 01:31:53,846 INFO L138 Inliner]: procedures = 33, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 647 [2024-11-09 01:31:53,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:31:53,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:31:53,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:31:53,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:31:53,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,911 INFO L175 MemorySlicer]: Split 166 memory accesses to 5 slices as follows [2, 34, 18, 19, 93]. 56 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 2, 4]. The 17 writes are split as follows [0, 6, 2, 2, 7]. [2024-11-09 01:31:53,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:31:53,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:31:53,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:31:53,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:31:53,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:31:53,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:31:54,008 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:31:54,011 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:31:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:31:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:31:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:31:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:31:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:31:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:31:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:31:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:31:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:31:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:31:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:31:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:31:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:31:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:31:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:31:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:31:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:31:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:31:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:31:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:31:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:31:54,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:31:54,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:31:54,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:31:54,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:31:54,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:31:54,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:31:54,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:31:54,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:31:54,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:31:54,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:31:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:31:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:31:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:31:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:31:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:31:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:31:54,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:31:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:31:54,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:31:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:31:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:31:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:31:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:31:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:31:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:31:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:31:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:31:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:31:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:31:54,218 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:31:54,220 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:31:54,963 INFO L? ?]: Removed 212 outVars from TransFormulas that were not future-live. [2024-11-09 01:31:54,964 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:31:54,979 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:31:54,979 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:31:54,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:31:54 BoogieIcfgContainer [2024-11-09 01:31:54,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:31:54,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:31:54,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:31:54,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:31:54,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:31:53" (1/3) ... [2024-11-09 01:31:54,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@855964e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:31:54, skipping insertion in model container [2024-11-09 01:31:54,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (2/3) ... [2024-11-09 01:31:54,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@855964e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:31:54, skipping insertion in model container [2024-11-09 01:31:54,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:31:54" (3/3) ... [2024-11-09 01:31:54,988 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-49.i [2024-11-09 01:31:55,018 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:31:55,018 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:31:55,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:31:55,091 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;@225837d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:31:55,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:31:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 114 states have internal predecessors, (167), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:31:55,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:31:55,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:55,114 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:55,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:55,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:55,121 INFO L85 PathProgramCache]: Analyzing trace with hash -705705352, now seen corresponding path program 1 times [2024-11-09 01:31:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:31:55,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311273216] [2024-11-09 01:31:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:55,138 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:31:55,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:31:55,141 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:31:55,143 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:31:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:55,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:31:55,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-09 01:31:55,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:31:55,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:31:55,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311273216] [2024-11-09 01:31:55,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311273216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:55,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:55,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:31:55,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703494253] [2024-11-09 01:31:55,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:55,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:31:55,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:31:55,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:31:55,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:31:55,548 INFO L87 Difference]: Start difference. First operand has 130 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 114 states have internal predecessors, (167), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:31:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:55,583 INFO L93 Difference]: Finished difference Result 253 states and 398 transitions. [2024-11-09 01:31:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:31:55,585 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2024-11-09 01:31:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:55,593 INFO L225 Difference]: With dead ends: 253 [2024-11-09 01:31:55,593 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 01:31:55,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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:31:55,601 INFO L432 NwaCegarLoop]: 188 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, 188 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:31:55,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:31:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 01:31:55,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-09 01:31:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 110 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:31:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2024-11-09 01:31:55,652 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 115 [2024-11-09 01:31:55,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:55,653 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2024-11-09 01:31:55,653 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:31:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2024-11-09 01:31:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:31:55,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:55,658 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:55,665 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:31:55,858 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:31:55,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:55,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:55,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1616218656, now seen corresponding path program 1 times [2024-11-09 01:31:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:31:55,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055237213] [2024-11-09 01:31:55,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:55,862 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:31:55,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:31:55,882 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:31:55,884 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:31:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:56,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:31:56,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:56,258 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:31:56,320 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 43 treesize of output 25 [2024-11-09 01:31:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:31:56,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:31:56,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:31:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055237213] [2024-11-09 01:31:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055237213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:56,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:56,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:31:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53948589] [2024-11-09 01:31:56,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:56,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:31:56,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:31:56,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:31:56,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:31:56,356 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:56,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:56,916 INFO L93 Difference]: Finished difference Result 374 states and 561 transitions. [2024-11-09 01:31:56,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:31:56,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-09 01:31:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:56,923 INFO L225 Difference]: With dead ends: 374 [2024-11-09 01:31:56,923 INFO L226 Difference]: Without dead ends: 251 [2024-11-09 01:31:56,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:31:56,925 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 179 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:56,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 838 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:31:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-09 01:31:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 130. [2024-11-09 01:31:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 114 states have (on average 1.4473684210526316) internal successors, (165), 114 states have internal predecessors, (165), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:31:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2024-11-09 01:31:56,954 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 115 [2024-11-09 01:31:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:56,956 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2024-11-09 01:31:56,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2024-11-09 01:31:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:31:56,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:56,962 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:56,972 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:31:57,162 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:31:57,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:57,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:57,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1437344069, now seen corresponding path program 1 times [2024-11-09 01:31:57,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:31:57,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462967447] [2024-11-09 01:31:57,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:57,166 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:31:57,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:31:57,170 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:31:57,171 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:31:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:57,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:31:57,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:57,517 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:31:57,564 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:31:57,788 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:31:57,798 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 18 treesize of output 10 [2024-11-09 01:31:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-09 01:31:57,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:31:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:31:58,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:31:58,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462967447] [2024-11-09 01:31:58,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462967447] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:31:58,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:31:58,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-09 01:31:58,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337033134] [2024-11-09 01:31:58,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:31:58,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:31:58,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:31:58,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:31:58,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:31:58,169 INFO L87 Difference]: Start difference. First operand 130 states and 193 transitions. Second operand has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-09 01:31:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:58,571 INFO L93 Difference]: Finished difference Result 265 states and 390 transitions. [2024-11-09 01:31:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:31:58,572 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) Word has length 117 [2024-11-09 01:31:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:58,575 INFO L225 Difference]: With dead ends: 265 [2024-11-09 01:31:58,575 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 01:31:58,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:31:58,580 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 382 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:58,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 702 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:31:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 01:31:58,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2024-11-09 01:31:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 117 states have internal predecessors, (167), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:31:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 195 transitions. [2024-11-09 01:31:58,594 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 195 transitions. Word has length 117 [2024-11-09 01:31:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:58,595 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 195 transitions. [2024-11-09 01:31:58,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-09 01:31:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 195 transitions. [2024-11-09 01:31:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:31:58,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:58,597 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:58,608 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 (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:31:58,801 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:31:58,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:58,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash -851948171, now seen corresponding path program 1 times [2024-11-09 01:31:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:31:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14784215] [2024-11-09 01:31:58,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:58,804 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:31:58,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:31:58,807 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:31:58,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 (5)] Waiting until timeout for monitored process [2024-11-09 01:31:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:59,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 01:31:59,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:59,169 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 12 treesize of output 8 [2024-11-09 01:31:59,493 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 40 treesize of output 31 [2024-11-09 01:31:59,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:59,980 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 74 treesize of output 38 [2024-11-09 01:32:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 01:32:00,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:00,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:00,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14784215] [2024-11-09 01:32:00,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14784215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:00,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:00,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 01:32:00,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779695422] [2024-11-09 01:32:00,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:00,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:32:00,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:00,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:32:00,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:32:00,167 INFO L87 Difference]: Start difference. First operand 134 states and 195 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:01,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:01,511 INFO L93 Difference]: Finished difference Result 485 states and 708 transitions. [2024-11-09 01:32:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:32:01,513 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-09 01:32:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:01,516 INFO L225 Difference]: With dead ends: 485 [2024-11-09 01:32:01,516 INFO L226 Difference]: Without dead ends: 354 [2024-11-09 01:32:01,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:32:01,519 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 658 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:01,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1937 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 01:32:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-09 01:32:01,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 297. [2024-11-09 01:32:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 272 states have (on average 1.474264705882353) internal successors, (401), 273 states have internal predecessors, (401), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:32:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2024-11-09 01:32:01,562 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 119 [2024-11-09 01:32:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:01,563 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2024-11-09 01:32:01,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2024-11-09 01:32:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:32:01,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:01,569 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:01,584 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 (5)] Ended with exit code 0 [2024-11-09 01:32:01,769 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:32:01,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:01,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:01,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1244975181, now seen corresponding path program 1 times [2024-11-09 01:32:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:01,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27541749] [2024-11-09 01:32:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:01,771 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:32:01,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:01,775 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:32:01,776 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:32:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:02,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:32:02,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:02,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:32:02,125 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 25 treesize of output 24 [2024-11-09 01:32:02,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:02,227 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:32:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:02,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:02,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:02,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27541749] [2024-11-09 01:32:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27541749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:02,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:02,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:32:02,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697237515] [2024-11-09 01:32:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:02,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:32:02,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:02,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:32:02,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:32:02,248 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:02,424 INFO L93 Difference]: Finished difference Result 702 states and 1041 transitions. [2024-11-09 01:32:02,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:32:02,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-09 01:32:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:02,431 INFO L225 Difference]: With dead ends: 702 [2024-11-09 01:32:02,431 INFO L226 Difference]: Without dead ends: 408 [2024-11-09 01:32:02,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:32:02,432 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 280 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:02,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 677 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:32:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-09 01:32:02,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 302. [2024-11-09 01:32:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 277 states have (on average 1.4657039711191335) internal successors, (406), 278 states have internal predecessors, (406), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:32:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 446 transitions. [2024-11-09 01:32:02,461 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 446 transitions. Word has length 119 [2024-11-09 01:32:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:02,462 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 446 transitions. [2024-11-09 01:32:02,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 446 transitions. [2024-11-09 01:32:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:32:02,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:02,465 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:02,477 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 (6)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:02,666 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:32:02,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:02,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:02,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1908134670, now seen corresponding path program 1 times [2024-11-09 01:32:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:02,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869456073] [2024-11-09 01:32:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:02,667 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:32:02,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:02,669 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:32:02,670 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:32:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:02,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:32:02,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:03,546 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 58 treesize of output 22 [2024-11-09 01:32:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 01:32:03,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:03,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:03,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869456073] [2024-11-09 01:32:03,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869456073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:03,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:03,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:32:03,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798370154] [2024-11-09 01:32:03,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:03,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:32:03,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:03,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:32:03,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:32:03,584 INFO L87 Difference]: Start difference. First operand 302 states and 446 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:04,180 INFO L93 Difference]: Finished difference Result 834 states and 1223 transitions. [2024-11-09 01:32:04,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:32:04,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-09 01:32:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:04,184 INFO L225 Difference]: With dead ends: 834 [2024-11-09 01:32:04,185 INFO L226 Difference]: Without dead ends: 535 [2024-11-09 01:32:04,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:04,186 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 348 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:04,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 790 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:32:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-09 01:32:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2024-11-09 01:32:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 482 states have (on average 1.4398340248962656) internal successors, (694), 486 states have internal predecessors, (694), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:32:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 774 transitions. [2024-11-09 01:32:04,219 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 774 transitions. Word has length 119 [2024-11-09 01:32:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:04,220 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 774 transitions. [2024-11-09 01:32:04,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 774 transitions. [2024-11-09 01:32:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:32:04,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:04,222 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:04,233 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:32:04,422 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:32:04,423 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:04,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1448874419, now seen corresponding path program 1 times [2024-11-09 01:32:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:04,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278545112] [2024-11-09 01:32:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:04,424 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:32:04,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:04,427 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:32:04,428 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:32:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:04,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 01:32:04,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:04,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:32:04,759 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 32 treesize of output 27 [2024-11-09 01:32:05,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:05,067 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 67 treesize of output 35 [2024-11-09 01:32:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:05,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:05,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278545112] [2024-11-09 01:32:05,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278545112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:05,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:05,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:32:05,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110889993] [2024-11-09 01:32:05,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:05,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:32:05,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:05,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:32:05,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:32:05,238 INFO L87 Difference]: Start difference. First operand 531 states and 774 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:06,272 INFO L93 Difference]: Finished difference Result 1429 states and 2075 transitions. [2024-11-09 01:32:06,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:32:06,273 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-09 01:32:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:06,278 INFO L225 Difference]: With dead ends: 1429 [2024-11-09 01:32:06,278 INFO L226 Difference]: Without dead ends: 901 [2024-11-09 01:32:06,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:32:06,280 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 283 mSDsluCounter, 2897 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 3264 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:06,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 3264 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:32:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-11-09 01:32:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 533. [2024-11-09 01:32:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 484 states have (on average 1.4421487603305785) internal successors, (698), 488 states have internal predecessors, (698), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:32:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 778 transitions. [2024-11-09 01:32:06,328 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 778 transitions. Word has length 119 [2024-11-09 01:32:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:06,328 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 778 transitions. [2024-11-09 01:32:06,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 778 transitions. [2024-11-09 01:32:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:32:06,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:06,331 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:06,342 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:32:06,531 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:32:06,532 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:06,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1637580791, now seen corresponding path program 1 times [2024-11-09 01:32:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:06,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423751060] [2024-11-09 01:32:06,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:06,533 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:32:06,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:06,534 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:32:06,536 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:32:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:06,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:32:06,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:06,863 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 12 treesize of output 8 [2024-11-09 01:32:07,062 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 34 treesize of output 29 [2024-11-09 01:32:07,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:07,199 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 38 treesize of output 20 [2024-11-09 01:32:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 01:32:07,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:07,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:07,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423751060] [2024-11-09 01:32:07,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423751060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:07,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:07,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:32:07,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132049956] [2024-11-09 01:32:07,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:07,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:32:07,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:07,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:32:07,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:32:07,224 INFO L87 Difference]: Start difference. First operand 533 states and 778 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:07,620 INFO L93 Difference]: Finished difference Result 1075 states and 1562 transitions. [2024-11-09 01:32:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:32:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-09 01:32:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:07,624 INFO L225 Difference]: With dead ends: 1075 [2024-11-09 01:32:07,624 INFO L226 Difference]: Without dead ends: 545 [2024-11-09 01:32:07,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:32:07,626 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 430 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:07,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1000 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:32:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-09 01:32:07,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 443. [2024-11-09 01:32:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 408 states have (on average 1.4509803921568627) internal successors, (592), 409 states have internal predecessors, (592), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:32:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 648 transitions. [2024-11-09 01:32:07,658 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 648 transitions. Word has length 119 [2024-11-09 01:32:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:07,658 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 648 transitions. [2024-11-09 01:32:07,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 648 transitions. [2024-11-09 01:32:07,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:32:07,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:07,661 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:07,671 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 (9)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:07,861 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:32:07,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:07,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1244553781, now seen corresponding path program 1 times [2024-11-09 01:32:07,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:07,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318568003] [2024-11-09 01:32:07,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:07,863 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:32:07,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:07,865 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:32:07,868 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:32:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:08,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:32:08,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:08,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:32:08,183 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 32 treesize of output 27 [2024-11-09 01:32:08,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:08,394 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 62 treesize of output 32 [2024-11-09 01:32:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:08,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:08,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:08,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318568003] [2024-11-09 01:32:08,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318568003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:08,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:08,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:32:08,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772239436] [2024-11-09 01:32:08,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:08,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:32:08,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:08,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:32:08,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:32:08,497 INFO L87 Difference]: Start difference. First operand 443 states and 648 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:09,058 INFO L93 Difference]: Finished difference Result 1079 states and 1574 transitions. [2024-11-09 01:32:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:32:09,058 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-09 01:32:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:09,063 INFO L225 Difference]: With dead ends: 1079 [2024-11-09 01:32:09,063 INFO L226 Difference]: Without dead ends: 639 [2024-11-09 01:32:09,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:32:09,066 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 142 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2449 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:09,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 2449 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:32:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-09 01:32:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 533. [2024-11-09 01:32:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 498 states have (on average 1.465863453815261) internal successors, (730), 499 states have internal predecessors, (730), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:32:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 786 transitions. [2024-11-09 01:32:09,097 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 786 transitions. Word has length 119 [2024-11-09 01:32:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:09,097 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 786 transitions. [2024-11-09 01:32:09,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:09,098 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 786 transitions. [2024-11-09 01:32:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:32:09,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:09,100 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:09,110 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:32:09,300 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:32:09,301 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:09,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:09,301 INFO L85 PathProgramCache]: Analyzing trace with hash 850296592, now seen corresponding path program 1 times [2024-11-09 01:32:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:09,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882424002] [2024-11-09 01:32:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:09,302 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:32:09,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:09,306 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:32:09,307 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:32:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:09,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:32:09,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 01:32:09,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:09,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:09,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882424002] [2024-11-09 01:32:09,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882424002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:09,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:09,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:32:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435485398] [2024-11-09 01:32:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:09,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:32:09,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:09,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:32:09,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:32:09,564 INFO L87 Difference]: Start difference. First operand 533 states and 786 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:09,619 INFO L93 Difference]: Finished difference Result 1063 states and 1569 transitions. [2024-11-09 01:32:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:32:09,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-09 01:32:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:09,623 INFO L225 Difference]: With dead ends: 1063 [2024-11-09 01:32:09,623 INFO L226 Difference]: Without dead ends: 533 [2024-11-09 01:32:09,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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:32:09,625 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 547 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:32:09,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 547 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:09,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-09 01:32:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2024-11-09 01:32:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 498 states have (on average 1.463855421686747) internal successors, (729), 499 states have internal predecessors, (729), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:32:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 785 transitions. [2024-11-09 01:32:09,655 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 785 transitions. Word has length 119 [2024-11-09 01:32:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:09,655 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 785 transitions. [2024-11-09 01:32:09,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 785 transitions. [2024-11-09 01:32:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:32:09,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:09,658 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:09,668 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 (11)] Ended with exit code 0 [2024-11-09 01:32:09,858 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:32:09,858 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:09,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:09,859 INFO L85 PathProgramCache]: Analyzing trace with hash 578744404, now seen corresponding path program 1 times [2024-11-09 01:32:09,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:09,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535929590] [2024-11-09 01:32:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:09,860 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:32:09,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:09,861 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:32:09,862 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:32:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:10,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:32:10,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:10,306 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 57 treesize of output 21 [2024-11-09 01:32:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:10,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:10,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:10,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535929590] [2024-11-09 01:32:10,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535929590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:10,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:10,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:32:10,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940833554] [2024-11-09 01:32:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:10,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:32:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:32:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:32:10,340 INFO L87 Difference]: Start difference. First operand 533 states and 785 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:10,694 INFO L93 Difference]: Finished difference Result 1205 states and 1775 transitions. [2024-11-09 01:32:10,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:32:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-09 01:32:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:10,698 INFO L225 Difference]: With dead ends: 1205 [2024-11-09 01:32:10,698 INFO L226 Difference]: Without dead ends: 675 [2024-11-09 01:32:10,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:32:10,700 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 214 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:10,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 772 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:32:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-11-09 01:32:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 672. [2024-11-09 01:32:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 630 states have (on average 1.4619047619047618) internal successors, (921), 632 states have internal predecessors, (921), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:32:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 987 transitions. [2024-11-09 01:32:10,731 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 987 transitions. Word has length 121 [2024-11-09 01:32:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:10,732 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 987 transitions. [2024-11-09 01:32:10,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 987 transitions. [2024-11-09 01:32:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:32:10,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:10,734 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:10,744 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 (12)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:10,934 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:32:10,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:10,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:10,935 INFO L85 PathProgramCache]: Analyzing trace with hash 912621421, now seen corresponding path program 1 times [2024-11-09 01:32:10,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:10,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441114614] [2024-11-09 01:32:10,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:10,936 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:32:10,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:10,937 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:32:10,938 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:32:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:11,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:32:11,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:11,748 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 58 treesize of output 22 [2024-11-09 01:32:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 01:32:11,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:11,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:11,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441114614] [2024-11-09 01:32:11,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441114614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:11,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:11,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:32:11,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142849857] [2024-11-09 01:32:11,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:11,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:32:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:11,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:32:11,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:32:11,778 INFO L87 Difference]: Start difference. First operand 672 states and 987 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:12,312 INFO L93 Difference]: Finished difference Result 1256 states and 1833 transitions. [2024-11-09 01:32:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:32:12,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2024-11-09 01:32:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:12,317 INFO L225 Difference]: With dead ends: 1256 [2024-11-09 01:32:12,318 INFO L226 Difference]: Without dead ends: 587 [2024-11-09 01:32:12,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:12,320 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 230 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:12,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 788 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:32:12,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-09 01:32:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 584. [2024-11-09 01:32:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 542 states have (on average 1.433579335793358) internal successors, (777), 544 states have internal predecessors, (777), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:32:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 843 transitions. [2024-11-09 01:32:12,360 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 843 transitions. Word has length 121 [2024-11-09 01:32:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:12,361 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 843 transitions. [2024-11-09 01:32:12,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 843 transitions. [2024-11-09 01:32:12,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:32:12,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:12,363 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:12,373 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 (13)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:12,563 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:32:12,564 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:12,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:12,564 INFO L85 PathProgramCache]: Analyzing trace with hash 36513319, now seen corresponding path program 1 times [2024-11-09 01:32:12,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:12,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974415192] [2024-11-09 01:32:12,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:12,565 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:32:12,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:12,566 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:32:12,567 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:32:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:12,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:32:12,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:12,870 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:32:13,291 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 85 treesize of output 51 [2024-11-09 01:32:13,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:13,370 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 42 treesize of output 38 [2024-11-09 01:32:13,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:13,610 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 126 treesize of output 66 [2024-11-09 01:32:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 149 proven. 30 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-09 01:32:13,653 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:32:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:13,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:13,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974415192] [2024-11-09 01:32:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974415192] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:32:13,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:32:13,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 14 [2024-11-09 01:32:13,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478705289] [2024-11-09 01:32:13,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:13,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:32:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:32:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:32:13,952 INFO L87 Difference]: Start difference. First operand 584 states and 843 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:14,218 INFO L93 Difference]: Finished difference Result 1349 states and 1941 transitions. [2024-11-09 01:32:14,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:32:14,219 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-09 01:32:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:14,223 INFO L225 Difference]: With dead ends: 1349 [2024-11-09 01:32:14,223 INFO L226 Difference]: Without dead ends: 768 [2024-11-09 01:32:14,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:32:14,225 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 109 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:14,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 865 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:32:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-09 01:32:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 688. [2024-11-09 01:32:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 646 states have (on average 1.438080495356037) internal successors, (929), 648 states have internal predecessors, (929), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:32:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 995 transitions. [2024-11-09 01:32:14,264 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 995 transitions. Word has length 121 [2024-11-09 01:32:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:14,267 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 995 transitions. [2024-11-09 01:32:14,268 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 995 transitions. [2024-11-09 01:32:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:32:14,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:14,270 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:14,282 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 (14)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:14,471 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:32:14,471 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:14,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2083950962, now seen corresponding path program 1 times [2024-11-09 01:32:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:14,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844386217] [2024-11-09 01:32:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:14,472 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:32:14,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:14,473 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:32:14,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 (15)] Waiting until timeout for monitored process [2024-11-09 01:32:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:14,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 01:32:14,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:14,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:32:14,944 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 41 treesize of output 32 [2024-11-09 01:32:15,056 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 33 treesize of output 21 [2024-11-09 01:32:15,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:15,433 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 86 treesize of output 46 [2024-11-09 01:32:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 193 proven. 21 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-09 01:32:15,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:32:16,025 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 34 treesize of output 22 [2024-11-09 01:32:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:16,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844386217] [2024-11-09 01:32:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844386217] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:32:16,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:32:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 25 [2024-11-09 01:32:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994187331] [2024-11-09 01:32:16,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:16,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:32:16,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:16,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:32:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:32:16,139 INFO L87 Difference]: Start difference. First operand 688 states and 995 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:17,501 INFO L93 Difference]: Finished difference Result 1686 states and 2398 transitions. [2024-11-09 01:32:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:32:17,501 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-09 01:32:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:17,506 INFO L225 Difference]: With dead ends: 1686 [2024-11-09 01:32:17,506 INFO L226 Difference]: Without dead ends: 1001 [2024-11-09 01:32:17,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2024-11-09 01:32:17,509 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 417 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:17,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 2213 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:32:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-09 01:32:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 598. [2024-11-09 01:32:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 556 states have (on average 1.4280575539568345) internal successors, (794), 558 states have internal predecessors, (794), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:32:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 860 transitions. [2024-11-09 01:32:17,554 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 860 transitions. Word has length 121 [2024-11-09 01:32:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:17,554 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 860 transitions. [2024-11-09 01:32:17,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 860 transitions. [2024-11-09 01:32:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:32:17,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:17,557 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:17,567 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:32:17,757 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:32:17,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:17,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:17,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1680529936, now seen corresponding path program 1 times [2024-11-09 01:32:17,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:17,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632213074] [2024-11-09 01:32:17,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:17,758 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:32:17,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:17,762 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:32:17,763 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:32:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:18,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:32:18,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:18,167 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 39 treesize of output 21 [2024-11-09 01:32:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-09 01:32:18,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:32:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:32:18,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:18,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632213074] [2024-11-09 01:32:18,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632213074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:32:18,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:32:18,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-09 01:32:18,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970853976] [2024-11-09 01:32:18,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:32:18,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:32:18,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:18,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:32:18,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:32:18,363 INFO L87 Difference]: Start difference. First operand 598 states and 860 transitions. Second operand has 10 states, 8 states have (on average 8.0) internal successors, (64), 10 states have internal predecessors, (64), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-09 01:32:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:18,631 INFO L93 Difference]: Finished difference Result 1221 states and 1742 transitions. [2024-11-09 01:32:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:32:18,632 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.0) internal successors, (64), 10 states have internal predecessors, (64), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 121 [2024-11-09 01:32:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:18,635 INFO L225 Difference]: With dead ends: 1221 [2024-11-09 01:32:18,635 INFO L226 Difference]: Without dead ends: 626 [2024-11-09 01:32:18,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:32:18,637 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 258 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:18,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 699 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:32:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-09 01:32:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 610. [2024-11-09 01:32:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 565 states have (on average 1.4141592920353983) internal successors, (799), 567 states have internal predecessors, (799), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:32:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 865 transitions. [2024-11-09 01:32:18,680 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 865 transitions. Word has length 121 [2024-11-09 01:32:18,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:18,681 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 865 transitions. [2024-11-09 01:32:18,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.0) internal successors, (64), 10 states have internal predecessors, (64), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-09 01:32:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 865 transitions. [2024-11-09 01:32:18,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:32:18,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:18,684 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:18,694 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 (16)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:18,884 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:32:18,884 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:18,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:18,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1461675218, now seen corresponding path program 1 times [2024-11-09 01:32:18,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:18,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263522461] [2024-11-09 01:32:18,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:18,885 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:32:18,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:18,887 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:32:18,887 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:32:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:19,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:32:19,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:19,190 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 12 treesize of output 8 [2024-11-09 01:32:19,317 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 31 treesize of output 26 [2024-11-09 01:32:19,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:19,518 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 58 treesize of output 32 [2024-11-09 01:32:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 01:32:19,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:19,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:19,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263522461] [2024-11-09 01:32:19,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263522461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:19,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:19,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:32:19,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033447542] [2024-11-09 01:32:19,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:19,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:32:19,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:19,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:32:19,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:32:19,621 INFO L87 Difference]: Start difference. First operand 610 states and 865 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:20,458 INFO L93 Difference]: Finished difference Result 1379 states and 1937 transitions. [2024-11-09 01:32:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:32:20,459 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2024-11-09 01:32:20,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:20,463 INFO L225 Difference]: With dead ends: 1379 [2024-11-09 01:32:20,464 INFO L226 Difference]: Without dead ends: 772 [2024-11-09 01:32:20,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:32:20,466 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 296 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:20,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 2146 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:32:20,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-09 01:32:20,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 619. [2024-11-09 01:32:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 574 states have (on average 1.4076655052264808) internal successors, (808), 576 states have internal predecessors, (808), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:32:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 874 transitions. [2024-11-09 01:32:20,516 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 874 transitions. Word has length 121 [2024-11-09 01:32:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:20,517 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 874 transitions. [2024-11-09 01:32:20,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 874 transitions. [2024-11-09 01:32:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:32:20,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:20,521 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:20,532 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:32:20,722 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:32:20,722 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:20,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:20,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1714153618, now seen corresponding path program 1 times [2024-11-09 01:32:20,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:20,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614904027] [2024-11-09 01:32:20,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:20,723 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:32:20,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:20,727 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:32:20,728 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:32:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:21,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:32:21,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:21,032 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 12 treesize of output 8 [2024-11-09 01:32:21,159 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 40 treesize of output 31 [2024-11-09 01:32:21,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:21,287 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 42 treesize of output 22 [2024-11-09 01:32:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 01:32:21,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:21,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614904027] [2024-11-09 01:32:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614904027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:21,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:21,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:32:21,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675144812] [2024-11-09 01:32:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:21,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:32:21,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:21,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:32:21,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:32:21,336 INFO L87 Difference]: Start difference. First operand 619 states and 874 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:21,919 INFO L93 Difference]: Finished difference Result 1417 states and 1979 transitions. [2024-11-09 01:32:21,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:32:21,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2024-11-09 01:32:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:21,923 INFO L225 Difference]: With dead ends: 1417 [2024-11-09 01:32:21,923 INFO L226 Difference]: Without dead ends: 801 [2024-11-09 01:32:21,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:32:21,925 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 295 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:21,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 2189 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:32:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-09 01:32:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 614. [2024-11-09 01:32:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 569 states have (on average 1.4094903339191565) internal successors, (802), 571 states have internal predecessors, (802), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:32:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 868 transitions. [2024-11-09 01:32:21,981 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 868 transitions. Word has length 121 [2024-11-09 01:32:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:21,981 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 868 transitions. [2024-11-09 01:32:21,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 868 transitions. [2024-11-09 01:32:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 01:32:21,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:21,983 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:21,992 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:32:22,183 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:32:22,184 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:22,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:22,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1026137293, now seen corresponding path program 1 times [2024-11-09 01:32:22,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:22,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118158278] [2024-11-09 01:32:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:22,185 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:32:22,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:22,187 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:32:22,188 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:32:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:22,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:32:22,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:23,014 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 87 treesize of output 33 [2024-11-09 01:32:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 183 proven. 24 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-09 01:32:23,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:32:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:23,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:23,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118158278] [2024-11-09 01:32:23,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118158278] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:32:23,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:32:23,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-11-09 01:32:23,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935709760] [2024-11-09 01:32:23,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:23,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:32:23,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:23,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:32:23,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:32:23,158 INFO L87 Difference]: Start difference. First operand 614 states and 868 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:23,305 INFO L93 Difference]: Finished difference Result 1144 states and 1595 transitions. [2024-11-09 01:32:23,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:32:23,306 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 01:32:23,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:23,308 INFO L225 Difference]: With dead ends: 1144 [2024-11-09 01:32:23,308 INFO L226 Difference]: Without dead ends: 533 [2024-11-09 01:32:23,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:32:23,309 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 61 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:23,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 729 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:32:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-09 01:32:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 396. [2024-11-09 01:32:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 365 states have (on average 1.4136986301369863) internal successors, (516), 365 states have internal predecessors, (516), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 01:32:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 562 transitions. [2024-11-09 01:32:23,351 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 562 transitions. Word has length 123 [2024-11-09 01:32:23,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:23,352 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 562 transitions. [2024-11-09 01:32:23,352 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 562 transitions. [2024-11-09 01:32:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 01:32:23,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:23,355 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:23,364 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 (19)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:23,555 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:32:23,555 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:23,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:23,556 INFO L85 PathProgramCache]: Analyzing trace with hash 584300748, now seen corresponding path program 1 times [2024-11-09 01:32:23,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:23,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201952424] [2024-11-09 01:32:23,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:23,556 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:32:23,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:23,558 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:32:23,559 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:32:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:23,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:32:23,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:23,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:23,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:23,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201952424] [2024-11-09 01:32:23,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201952424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:23,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:23,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:32:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296337885] [2024-11-09 01:32:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:23,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:32:23,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:23,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:32:23,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:32:23,834 INFO L87 Difference]: Start difference. First operand 396 states and 562 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:23,869 INFO L93 Difference]: Finished difference Result 402 states and 568 transitions. [2024-11-09 01:32:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:32:23,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 01:32:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:23,872 INFO L225 Difference]: With dead ends: 402 [2024-11-09 01:32:23,872 INFO L226 Difference]: Without dead ends: 400 [2024-11-09 01:32:23,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:32:23,873 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:23,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 900 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-09 01:32:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2024-11-09 01:32:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 369 states have (on average 1.4092140921409213) internal successors, (520), 369 states have internal predecessors, (520), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 01:32:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 566 transitions. [2024-11-09 01:32:23,906 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 566 transitions. Word has length 123 [2024-11-09 01:32:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:23,906 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 566 transitions. [2024-11-09 01:32:23,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 566 transitions. [2024-11-09 01:32:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 01:32:23,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:23,908 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:23,919 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 (20)] Ended with exit code 0 [2024-11-09 01:32:24,108 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:32:24,109 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:24,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:24,109 INFO L85 PathProgramCache]: Analyzing trace with hash 832806030, now seen corresponding path program 1 times [2024-11-09 01:32:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:24,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208118723] [2024-11-09 01:32:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:24,110 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:32:24,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:24,111 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:32:24,116 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:32:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:24,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:32:24,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:24,445 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:32:24,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:24,571 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 77 treesize of output 54 [2024-11-09 01:32:24,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:24,638 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 42 [2024-11-09 01:32:24,641 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 40 treesize of output 22 [2024-11-09 01:32:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:24,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:24,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:24,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208118723] [2024-11-09 01:32:24,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208118723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:24,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:24,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:32:24,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827757020] [2024-11-09 01:32:24,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:24,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:32:24,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:24,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:32:24,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:32:24,681 INFO L87 Difference]: Start difference. First operand 400 states and 566 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:25,746 INFO L93 Difference]: Finished difference Result 1097 states and 1526 transitions. [2024-11-09 01:32:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:32:25,747 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 01:32:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:25,750 INFO L225 Difference]: With dead ends: 1097 [2024-11-09 01:32:25,751 INFO L226 Difference]: Without dead ends: 700 [2024-11-09 01:32:25,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:25,753 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 400 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:25,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 947 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:32:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-09 01:32:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 692. [2024-11-09 01:32:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 617 states have (on average 1.3776337115072934) internal successors, (850), 621 states have internal predecessors, (850), 53 states have call successors, (53), 21 states have call predecessors, (53), 21 states have return successors, (53), 49 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-09 01:32:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 956 transitions. [2024-11-09 01:32:25,833 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 956 transitions. Word has length 123 [2024-11-09 01:32:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:25,835 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 956 transitions. [2024-11-09 01:32:25,835 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 956 transitions. [2024-11-09 01:32:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 01:32:25,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:25,837 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:25,848 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:32:26,037 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:32:26,038 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:26,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1051660748, now seen corresponding path program 1 times [2024-11-09 01:32:26,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:26,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615415935] [2024-11-09 01:32:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:26,039 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:32:26,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:26,040 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:32:26,046 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:32:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:26,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:32:26,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:26,349 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:32:26,433 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 62 treesize of output 40 [2024-11-09 01:32:26,476 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 35 [2024-11-09 01:32:26,478 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 41 treesize of output 23 [2024-11-09 01:32:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:26,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:26,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:26,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615415935] [2024-11-09 01:32:26,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615415935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:26,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:26,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:32:26,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292227534] [2024-11-09 01:32:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:26,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:32:26,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:26,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:32:26,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:32:26,526 INFO L87 Difference]: Start difference. First operand 692 states and 956 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:27,966 INFO L93 Difference]: Finished difference Result 1595 states and 2199 transitions. [2024-11-09 01:32:27,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:32:27,967 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 01:32:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:27,972 INFO L225 Difference]: With dead ends: 1595 [2024-11-09 01:32:27,972 INFO L226 Difference]: Without dead ends: 906 [2024-11-09 01:32:27,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:27,974 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 298 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:27,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1189 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 01:32:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-11-09 01:32:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 800. [2024-11-09 01:32:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 725 states have (on average 1.3944827586206896) internal successors, (1011), 729 states have internal predecessors, (1011), 53 states have call successors, (53), 21 states have call predecessors, (53), 21 states have return successors, (53), 49 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-09 01:32:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1117 transitions. [2024-11-09 01:32:28,067 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1117 transitions. Word has length 123 [2024-11-09 01:32:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:28,068 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1117 transitions. [2024-11-09 01:32:28,068 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1117 transitions. [2024-11-09 01:32:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 01:32:28,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:28,070 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:28,081 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:32:28,270 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:32:28,271 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:28,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:28,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1795626592, now seen corresponding path program 1 times [2024-11-09 01:32:28,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:28,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455477236] [2024-11-09 01:32:28,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:28,272 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:32:28,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:28,273 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:32:28,274 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:32:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:28,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:32:28,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:28,555 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:32:28,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:28,681 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 76 treesize of output 53 [2024-11-09 01:32:28,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:28,760 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 67 treesize of output 41 [2024-11-09 01:32:28,766 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 39 treesize of output 21 [2024-11-09 01:32:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:28,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:28,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:28,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455477236] [2024-11-09 01:32:28,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455477236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:28,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:28,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:32:28,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674874164] [2024-11-09 01:32:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:28,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:32:28,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:28,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:32:28,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:32:28,838 INFO L87 Difference]: Start difference. First operand 800 states and 1117 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:30,432 INFO L93 Difference]: Finished difference Result 1807 states and 2512 transitions. [2024-11-09 01:32:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:32:30,433 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 01:32:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:30,437 INFO L225 Difference]: With dead ends: 1807 [2024-11-09 01:32:30,437 INFO L226 Difference]: Without dead ends: 1010 [2024-11-09 01:32:30,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:30,438 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 294 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:30,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1276 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 01:32:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-11-09 01:32:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 825. [2024-11-09 01:32:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 774 states have (on average 1.4276485788113695) internal successors, (1105), 776 states have internal predecessors, (1105), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 01:32:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1173 transitions. [2024-11-09 01:32:30,519 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1173 transitions. Word has length 123 [2024-11-09 01:32:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:30,519 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1173 transitions. [2024-11-09 01:32:30,519 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1173 transitions. [2024-11-09 01:32:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 01:32:30,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:30,522 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:30,532 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:32:30,722 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:32:30,722 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:30,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:30,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1681692254, now seen corresponding path program 1 times [2024-11-09 01:32:30,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:30,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623673216] [2024-11-09 01:32:30,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:30,723 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:32:30,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:30,725 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:32:30,726 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:32:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:31,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:32:31,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:31,062 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:32:31,159 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 61 treesize of output 39 [2024-11-09 01:32:31,205 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 34 [2024-11-09 01:32:31,208 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 40 treesize of output 22 [2024-11-09 01:32:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:31,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:31,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623673216] [2024-11-09 01:32:31,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623673216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:31,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:31,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:32:31,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163140871] [2024-11-09 01:32:31,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:31,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:32:31,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:31,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:32:31,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:32:31,253 INFO L87 Difference]: Start difference. First operand 825 states and 1173 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:33,151 INFO L93 Difference]: Finished difference Result 2038 states and 2852 transitions. [2024-11-09 01:32:33,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:32:33,152 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 01:32:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:33,158 INFO L225 Difference]: With dead ends: 2038 [2024-11-09 01:32:33,158 INFO L226 Difference]: Without dead ends: 1216 [2024-11-09 01:32:33,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:33,160 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 304 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:33,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1328 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 01:32:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-09 01:32:33,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 933. [2024-11-09 01:32:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 882 states have (on average 1.435374149659864) internal successors, (1266), 884 states have internal predecessors, (1266), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 01:32:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1334 transitions. [2024-11-09 01:32:33,232 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1334 transitions. Word has length 123 [2024-11-09 01:32:33,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:33,232 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1334 transitions. [2024-11-09 01:32:33,233 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1334 transitions. [2024-11-09 01:32:33,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:32:33,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:33,235 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:33,246 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 (24)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:33,436 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:32:33,437 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:33,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:33,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1623524199, now seen corresponding path program 1 times [2024-11-09 01:32:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:33,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267621926] [2024-11-09 01:32:33,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:33,438 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:32:33,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:33,442 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:32:33,444 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:32:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:33,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:32:33,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:33,778 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:32:33,924 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 15 [2024-11-09 01:32:33,939 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 26 [2024-11-09 01:32:33,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:33,968 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 15 [2024-11-09 01:32:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-09 01:32:33,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:32:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:32:34,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:34,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267621926] [2024-11-09 01:32:34,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267621926] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:32:34,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:32:34,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-09 01:32:34,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829800752] [2024-11-09 01:32:34,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:32:34,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:32:34,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:34,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:32:34,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:32:34,199 INFO L87 Difference]: Start difference. First operand 933 states and 1334 transitions. Second operand has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-09 01:32:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:35,038 INFO L93 Difference]: Finished difference Result 2088 states and 2954 transitions. [2024-11-09 01:32:35,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 01:32:35,039 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 125 [2024-11-09 01:32:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:35,043 INFO L225 Difference]: With dead ends: 2088 [2024-11-09 01:32:35,043 INFO L226 Difference]: Without dead ends: 1158 [2024-11-09 01:32:35,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2024-11-09 01:32:35,045 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 697 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:35,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1102 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:32:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-09 01:32:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 933. [2024-11-09 01:32:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 882 states have (on average 1.4263038548752835) internal successors, (1258), 884 states have internal predecessors, (1258), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 01:32:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1326 transitions. [2024-11-09 01:32:35,124 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1326 transitions. Word has length 125 [2024-11-09 01:32:35,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:35,124 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1326 transitions. [2024-11-09 01:32:35,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-09 01:32:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1326 transitions. [2024-11-09 01:32:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:32:35,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:35,127 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:35,137 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:32:35,327 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:32:35,327 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:35,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash 35176297, now seen corresponding path program 1 times [2024-11-09 01:32:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:35,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541063296] [2024-11-09 01:32:35,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:35,329 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:32:35,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:35,330 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:32:35,331 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:32:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:35,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:32:35,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:35,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:35,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:35,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541063296] [2024-11-09 01:32:35,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541063296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:35,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:35,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:32:35,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141936468] [2024-11-09 01:32:35,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:35,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:32:35,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:35,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:32:35,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:32:35,634 INFO L87 Difference]: Start difference. First operand 933 states and 1326 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:35,949 INFO L93 Difference]: Finished difference Result 2481 states and 3512 transitions. [2024-11-09 01:32:35,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:32:35,949 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-09 01:32:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:35,955 INFO L225 Difference]: With dead ends: 2481 [2024-11-09 01:32:35,956 INFO L226 Difference]: Without dead ends: 1551 [2024-11-09 01:32:35,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 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:32:35,958 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 140 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:35,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 928 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:32:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-11-09 01:32:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 981. [2024-11-09 01:32:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 930 states have (on average 1.4172043010752688) internal successors, (1318), 932 states have internal predecessors, (1318), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 01:32:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1386 transitions. [2024-11-09 01:32:36,044 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1386 transitions. Word has length 125 [2024-11-09 01:32:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:36,044 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1386 transitions. [2024-11-09 01:32:36,044 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1386 transitions. [2024-11-09 01:32:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:32:36,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:36,047 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:36,058 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 (26)] Ended with exit code 0 [2024-11-09 01:32:36,247 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:32:36,248 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:36,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash -551629717, now seen corresponding path program 1 times [2024-11-09 01:32:36,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:36,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895615730] [2024-11-09 01:32:36,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:36,249 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:32:36,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:36,252 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:32:36,253 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:32:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:36,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:32:36,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:36,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:32:36,755 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 68 treesize of output 32 [2024-11-09 01:32:37,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:37,359 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 126 treesize of output 54 [2024-11-09 01:32:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-09 01:32:37,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:37,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:37,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895615730] [2024-11-09 01:32:37,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895615730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:37,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:37,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:32:37,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456124425] [2024-11-09 01:32:37,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:37,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:32:37,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:37,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:32:37,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:37,414 INFO L87 Difference]: Start difference. First operand 981 states and 1386 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:38,029 INFO L93 Difference]: Finished difference Result 2871 states and 4066 transitions. [2024-11-09 01:32:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:32:38,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-09 01:32:38,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:38,037 INFO L225 Difference]: With dead ends: 2871 [2024-11-09 01:32:38,037 INFO L226 Difference]: Without dead ends: 1893 [2024-11-09 01:32:38,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:32:38,039 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 291 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:38,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1067 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:32:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2024-11-09 01:32:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1128. [2024-11-09 01:32:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1056 states have (on average 1.4043560606060606) internal successors, (1483), 1059 states have internal predecessors, (1483), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 01:32:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1579 transitions. [2024-11-09 01:32:38,132 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1579 transitions. Word has length 125 [2024-11-09 01:32:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:38,132 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1579 transitions. [2024-11-09 01:32:38,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1579 transitions. [2024-11-09 01:32:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:32:38,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:38,136 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:38,146 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 (27)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:38,336 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:32:38,337 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:38,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash 303655785, now seen corresponding path program 1 times [2024-11-09 01:32:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:38,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925213016] [2024-11-09 01:32:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:38,338 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:32:38,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:38,339 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:32:38,340 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:32:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:38,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 01:32:38,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:38,668 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:32:38,890 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 52 treesize of output 30 [2024-11-09 01:32:38,960 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 43 treesize of output 25 [2024-11-09 01:32:38,963 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 40 treesize of output 22 [2024-11-09 01:32:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-09 01:32:39,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:39,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:39,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925213016] [2024-11-09 01:32:39,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925213016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:39,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:39,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:32:39,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292100501] [2024-11-09 01:32:39,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:39,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:32:39,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:39,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:32:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:32:39,001 INFO L87 Difference]: Start difference. First operand 1128 states and 1579 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:40,567 INFO L93 Difference]: Finished difference Result 2772 states and 3824 transitions. [2024-11-09 01:32:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:32:40,569 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-09 01:32:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:40,575 INFO L225 Difference]: With dead ends: 2772 [2024-11-09 01:32:40,575 INFO L226 Difference]: Without dead ends: 1647 [2024-11-09 01:32:40,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:40,578 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 771 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:40,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 688 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 01:32:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-11-09 01:32:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1148. [2024-11-09 01:32:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1076 states have (on average 1.407992565055762) internal successors, (1515), 1079 states have internal predecessors, (1515), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 01:32:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1611 transitions. [2024-11-09 01:32:40,664 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1611 transitions. Word has length 125 [2024-11-09 01:32:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:40,664 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1611 transitions. [2024-11-09 01:32:40,664 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1611 transitions. [2024-11-09 01:32:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:32:40,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:40,667 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:40,677 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 (28)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:40,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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:32:40,867 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:40,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:40,868 INFO L85 PathProgramCache]: Analyzing trace with hash 169642279, now seen corresponding path program 1 times [2024-11-09 01:32:40,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:40,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229566212] [2024-11-09 01:32:40,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:40,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:32:40,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:40,872 INFO L229 MonitoredProcess]: Starting monitored process 29 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:32:40,872 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 (29)] Waiting until timeout for monitored process [2024-11-09 01:32:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 01:32:41,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:41,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:32:41,196 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:32:41,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-09 01:32:41,410 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 61 treesize of output 39 [2024-11-09 01:32:41,711 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 34 [2024-11-09 01:32:41,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:41,716 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 80 treesize of output 42 [2024-11-09 01:32:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:41,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:41,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:41,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229566212] [2024-11-09 01:32:41,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229566212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:41,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:41,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 01:32:41,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819590236] [2024-11-09 01:32:41,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:41,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 01:32:41,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:41,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 01:32:41,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:32:41,794 INFO L87 Difference]: Start difference. First operand 1148 states and 1611 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:44,872 INFO L93 Difference]: Finished difference Result 2784 states and 3809 transitions. [2024-11-09 01:32:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:32:44,874 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-09 01:32:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:44,880 INFO L225 Difference]: With dead ends: 2784 [2024-11-09 01:32:44,881 INFO L226 Difference]: Without dead ends: 1639 [2024-11-09 01:32:44,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:32:44,883 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 524 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:44,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1996 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 01:32:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-09 01:32:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1139. [2024-11-09 01:32:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1067 states have (on average 1.4104967197750702) internal successors, (1505), 1070 states have internal predecessors, (1505), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 01:32:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1601 transitions. [2024-11-09 01:32:44,963 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1601 transitions. Word has length 125 [2024-11-09 01:32:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:44,963 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1601 transitions. [2024-11-09 01:32:44,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1601 transitions. [2024-11-09 01:32:44,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:32:44,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:44,967 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:44,978 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 (29)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:45,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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:32:45,168 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:45,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1082942919, now seen corresponding path program 1 times [2024-11-09 01:32:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:45,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329892418] [2024-11-09 01:32:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:45,169 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:32:45,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:45,170 INFO L229 MonitoredProcess]: Starting monitored process 30 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:32:45,171 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 (30)] Waiting until timeout for monitored process [2024-11-09 01:32:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 01:32:45,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:45,507 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:32:45,542 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:32:45,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:45,947 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 34 treesize of output 36 [2024-11-09 01:32:45,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:45,993 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 51 treesize of output 50 [2024-11-09 01:32:46,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:46,162 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 80 treesize of output 38 [2024-11-09 01:32:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-09 01:32:46,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:32:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:46,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:46,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329892418] [2024-11-09 01:32:46,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329892418] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:32:46,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:32:46,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2024-11-09 01:32:46,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180775587] [2024-11-09 01:32:46,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:46,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:32:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:46,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:32:46,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:32:46,564 INFO L87 Difference]: Start difference. First operand 1139 states and 1601 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:46,943 INFO L93 Difference]: Finished difference Result 2326 states and 3264 transitions. [2024-11-09 01:32:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:32:46,944 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-09 01:32:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:46,947 INFO L225 Difference]: With dead ends: 2326 [2024-11-09 01:32:46,947 INFO L226 Difference]: Without dead ends: 1190 [2024-11-09 01:32:46,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:32:46,949 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 106 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:46,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1978 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:32:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-09 01:32:47,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1142. [2024-11-09 01:32:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1070 states have (on average 1.4102803738317757) internal successors, (1509), 1073 states have internal predecessors, (1509), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 01:32:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1605 transitions. [2024-11-09 01:32:47,036 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1605 transitions. Word has length 125 [2024-11-09 01:32:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:47,036 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1605 transitions. [2024-11-09 01:32:47,036 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1605 transitions. [2024-11-09 01:32:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:32:47,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:47,038 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:47,047 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 (30)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:47,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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:32:47,239 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:47,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash 402884549, now seen corresponding path program 1 times [2024-11-09 01:32:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:47,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238637251] [2024-11-09 01:32:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:47,240 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:32:47,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:47,241 INFO L229 MonitoredProcess]: Starting monitored process 31 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:32:47,242 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 (31)] Waiting until timeout for monitored process [2024-11-09 01:32:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 01:32:47,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:47,564 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:32:47,721 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 52 treesize of output 38 [2024-11-09 01:32:47,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:32:47,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2024-11-09 01:32:47,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2024-11-09 01:32:47,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:47,830 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 67 treesize of output 51 [2024-11-09 01:32:47,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:47,985 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 90 treesize of output 42 [2024-11-09 01:32:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-09 01:32:47,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:32:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:32:48,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:48,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238637251] [2024-11-09 01:32:48,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238637251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:32:48,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:32:48,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-11-09 01:32:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700239228] [2024-11-09 01:32:48,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:32:48,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:32:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:48,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:32:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:32:48,183 INFO L87 Difference]: Start difference. First operand 1142 states and 1605 transitions. Second operand has 12 states, 10 states have (on average 8.4) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-09 01:32:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:48,757 INFO L93 Difference]: Finished difference Result 2449 states and 3433 transitions. [2024-11-09 01:32:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 01:32:48,758 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.4) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 125 [2024-11-09 01:32:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:48,762 INFO L225 Difference]: With dead ends: 2449 [2024-11-09 01:32:48,762 INFO L226 Difference]: Without dead ends: 1310 [2024-11-09 01:32:48,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:32:48,764 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 418 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:48,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 887 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:32:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2024-11-09 01:32:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1140. [2024-11-09 01:32:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1068 states have (on average 1.408239700374532) internal successors, (1504), 1071 states have internal predecessors, (1504), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 01:32:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1600 transitions. [2024-11-09 01:32:48,853 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1600 transitions. Word has length 125 [2024-11-09 01:32:48,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:48,854 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1600 transitions. [2024-11-09 01:32:48,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.4) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-09 01:32:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1600 transitions. [2024-11-09 01:32:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:32:48,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:48,856 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:48,866 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 (31)] Ended with exit code 0 [2024-11-09 01:32:49,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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:32:49,057 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:49,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:49,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1524087035, now seen corresponding path program 1 times [2024-11-09 01:32:49,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:49,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441953024] [2024-11-09 01:32:49,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:49,057 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:32:49,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:49,059 INFO L229 MonitoredProcess]: Starting monitored process 32 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:32:49,060 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 (32)] Waiting until timeout for monitored process [2024-11-09 01:32:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:49,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:32:49,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:49,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:32:49,405 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:32:49,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:49,743 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 34 treesize of output 36 [2024-11-09 01:32:49,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:49,793 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 57 treesize of output 29 [2024-11-09 01:32:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-09 01:32:49,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:32:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:32:50,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:50,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441953024] [2024-11-09 01:32:50,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441953024] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:32:50,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:32:50,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2024-11-09 01:32:50,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810452162] [2024-11-09 01:32:50,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:32:50,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 01:32:50,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:50,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 01:32:50,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:32:50,064 INFO L87 Difference]: Start difference. First operand 1140 states and 1600 transitions. Second operand has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 15 states have internal predecessors, (97), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-09 01:32:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:51,062 INFO L93 Difference]: Finished difference Result 2632 states and 3617 transitions. [2024-11-09 01:32:51,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 01:32:51,062 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 15 states have internal predecessors, (97), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) Word has length 125 [2024-11-09 01:32:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:51,068 INFO L225 Difference]: With dead ends: 2632 [2024-11-09 01:32:51,068 INFO L226 Difference]: Without dead ends: 1495 [2024-11-09 01:32:51,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2024-11-09 01:32:51,070 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 825 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:51,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1775 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:32:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-09 01:32:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1140. [2024-11-09 01:32:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1068 states have (on average 1.402621722846442) internal successors, (1498), 1071 states have internal predecessors, (1498), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 01:32:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1594 transitions. [2024-11-09 01:32:51,173 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1594 transitions. Word has length 125 [2024-11-09 01:32:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:51,174 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1594 transitions. [2024-11-09 01:32:51,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 15 states have internal predecessors, (97), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-09 01:32:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1594 transitions. [2024-11-09 01:32:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:32:51,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:51,176 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:51,184 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 (32)] Ended with exit code 0 [2024-11-09 01:32:51,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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:32:51,377 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:51,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash 706438585, now seen corresponding path program 1 times [2024-11-09 01:32:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832076637] [2024-11-09 01:32:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:51,378 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:32:51,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:51,380 INFO L229 MonitoredProcess]: Starting monitored process 33 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:32:51,381 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 (33)] Waiting until timeout for monitored process [2024-11-09 01:32:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:51,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:32:51,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:51,714 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:32:51,777 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 41 treesize of output 25 [2024-11-09 01:32:51,809 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 32 treesize of output 20 [2024-11-09 01:32:51,813 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 26 treesize of output 14 [2024-11-09 01:32:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:51,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:51,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:51,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832076637] [2024-11-09 01:32:51,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832076637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:51,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:51,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:32:51,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803646820] [2024-11-09 01:32:51,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:51,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:32:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:51,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:32:51,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:32:51,850 INFO L87 Difference]: Start difference. First operand 1140 states and 1594 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)