./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-61.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 9d4c4ba5fceaa6bfb2098951964c33b59994f146ab7abe517b65f1a8d594c6fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:37:26,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:37:26,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:37:26,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:37:26,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:37:26,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:37:26,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:37:26,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:37:26,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:37:26,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:37:26,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:37:26,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:37:26,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:37:26,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:37:26,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:37:26,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:37:26,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:37:26,734 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:37:26,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:37:26,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:37:26,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:37:26,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:37:26,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:37:26,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:37:26,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:37:26,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:37:26,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:37:26,737 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:37:26,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:37:26,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:37:26,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:37:26,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:37:26,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:37:26,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:37:26,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:37:26,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:37:26,739 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:37:26,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:37:26,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:37:26,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:37:26,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:37:26,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:37:26,741 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 -> 9d4c4ba5fceaa6bfb2098951964c33b59994f146ab7abe517b65f1a8d594c6fc [2024-11-19 00:37:26,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:37:26,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:37:26,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:37:26,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:37:26,965 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:37:26,967 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-61.i [2024-11-19 00:37:28,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:37:28,431 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:37:28,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2024-11-19 00:37:28,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47be54fd/ae3c7365a0a54231b2e9603e070bd47b/FLAG1d8326db0 [2024-11-19 00:37:28,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47be54fd/ae3c7365a0a54231b2e9603e070bd47b [2024-11-19 00:37:28,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:37:28,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:37:28,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:37:28,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:37:28,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:37:28,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e686f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28, skipping insertion in model container [2024-11-19 00:37:28,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:37:28,653 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-61.i[916,929] [2024-11-19 00:37:28,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:37:28,743 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:37:28,751 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-61.i[916,929] [2024-11-19 00:37:28,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:37:28,812 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:37:28,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28 WrapperNode [2024-11-19 00:37:28,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:37:28,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:37:28,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:37:28,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:37:28,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,873 INFO L138 Inliner]: procedures = 30, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 513 [2024-11-19 00:37:28,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:37:28,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:37:28,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:37:28,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:37:28,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,904 INFO L175 MemorySlicer]: Split 148 memory accesses to 7 slices as follows [2, 35, 5, 27, 3, 73, 3]. 49 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 4, 1, 2, 1, 0, 1]. The 35 writes are split as follows [0, 6, 1, 2, 1, 24, 1]. [2024-11-19 00:37:28,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:37:28,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:37:28,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:37:28,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:37:28,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (1/1) ... [2024-11-19 00:37:28,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:37:28,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:28,969 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-19 00:37:28,971 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-19 00:37:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:37:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-19 00:37:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-19 00:37:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-19 00:37:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-19 00:37:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-19 00:37:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-19 00:37:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-19 00:37:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:37:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:37:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:37:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:37:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:37:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:37:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 00:37:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:37:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:37:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:37:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:37:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:37:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:37:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 00:37:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:37:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:37:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:37:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:37:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:37:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:37:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 00:37:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:37:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:37:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:37:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:37:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:37:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:37:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 00:37:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:37:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:37:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:37:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:37:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:37:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:37:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 00:37:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:37:29,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:37:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:37:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:37:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:37:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:37:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:37:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:37:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 00:37:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:37:29,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:37:29,167 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:37:29,169 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:37:29,606 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-11-19 00:37:29,606 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:37:29,617 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:37:29,617 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:37:29,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:29 BoogieIcfgContainer [2024-11-19 00:37:29,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:37:29,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:37:29,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:37:29,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:37:29,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:37:28" (1/3) ... [2024-11-19 00:37:29,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1438eef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:37:29, skipping insertion in model container [2024-11-19 00:37:29,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:28" (2/3) ... [2024-11-19 00:37:29,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1438eef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:37:29, skipping insertion in model container [2024-11-19 00:37:29,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:29" (3/3) ... [2024-11-19 00:37:29,623 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-61.i [2024-11-19 00:37:29,635 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:37:29,635 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:37:29,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:37:29,681 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;@3ea6b5a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:37:29,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:37:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:37:29,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:29,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:29,697 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:29,697 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:29,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1550515261, now seen corresponding path program 1 times [2024-11-19 00:37:29,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206141121] [2024-11-19 00:37:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:29,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2024-11-19 00:37:30,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206141121] [2024-11-19 00:37:30,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206141121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070787370] [2024-11-19 00:37:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:30,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:30,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:30,024 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-19 00:37:30,026 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-19 00:37:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:30,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:37:30,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2024-11-19 00:37:30,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:30,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070787370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:30,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:30,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:37:30,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150292615] [2024-11-19 00:37:30,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:30,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:37:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:30,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:37:30,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:37:30,378 INFO L87 Difference]: Start difference. First operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:37:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:30,405 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2024-11-19 00:37:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:37:30,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2024-11-19 00:37:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:30,415 INFO L225 Difference]: With dead ends: 233 [2024-11-19 00:37:30,415 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 00:37:30,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 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-19 00:37:30,421 INFO L432 NwaCegarLoop]: 168 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, 168 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-19 00:37:30,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 00:37:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-19 00:37:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:37:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-19 00:37:30,464 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 190 [2024-11-19 00:37:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:30,464 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-19 00:37:30,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:37:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-19 00:37:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:30,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:30,467 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:30,483 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-19 00:37:30,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:37:30,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:30,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:30,670 INFO L85 PathProgramCache]: Analyzing trace with hash 615561193, now seen corresponding path program 1 times [2024-11-19 00:37:30,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:30,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148469945] [2024-11-19 00:37:30,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:37:31,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:31,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148469945] [2024-11-19 00:37:31,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148469945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:31,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:31,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:37:31,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18862527] [2024-11-19 00:37:31,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:31,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:31,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:31,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:37:31,026 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:31,067 INFO L93 Difference]: Finished difference Result 232 states and 337 transitions. [2024-11-19 00:37:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:31,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-11-19 00:37:31,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:31,069 INFO L225 Difference]: With dead ends: 232 [2024-11-19 00:37:31,069 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 00:37:31,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-19 00:37:31,072 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:31,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 484 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:31,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 00:37:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-19 00:37:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:37:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2024-11-19 00:37:31,092 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 190 [2024-11-19 00:37:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:31,094 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2024-11-19 00:37:31,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2024-11-19 00:37:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:31,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:31,099 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:31,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:37:31,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:31,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1295619563, now seen corresponding path program 1 times [2024-11-19 00:37:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:31,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572116938] [2024-11-19 00:37:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:31,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:37:31,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:31,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572116938] [2024-11-19 00:37:31,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572116938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:31,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:31,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:37:31,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140522577] [2024-11-19 00:37:31,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:31,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:31,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:31,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:31,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:37:31,288 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:31,316 INFO L93 Difference]: Finished difference Result 236 states and 341 transitions. [2024-11-19 00:37:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:31,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-11-19 00:37:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:31,321 INFO L225 Difference]: With dead ends: 236 [2024-11-19 00:37:31,321 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 00:37:31,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-19 00:37:31,326 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:31,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 00:37:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-19 00:37:31,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:37:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2024-11-19 00:37:31,340 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 190 [2024-11-19 00:37:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:31,340 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2024-11-19 00:37:31,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2024-11-19 00:37:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:31,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:31,343 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:31,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:37:31,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:31,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:31,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1297466605, now seen corresponding path program 1 times [2024-11-19 00:37:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:31,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860176887] [2024-11-19 00:37:31,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:31,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:37:31,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:31,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860176887] [2024-11-19 00:37:31,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860176887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:31,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:31,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:37:31,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124747475] [2024-11-19 00:37:31,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:31,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:37:31,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:31,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:37:31,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:37:31,912 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:32,081 INFO L93 Difference]: Finished difference Result 291 states and 418 transitions. [2024-11-19 00:37:32,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:37:32,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-11-19 00:37:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:32,083 INFO L225 Difference]: With dead ends: 291 [2024-11-19 00:37:32,084 INFO L226 Difference]: Without dead ends: 174 [2024-11-19 00:37:32,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 00:37:32,086 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 70 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:32,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 576 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:37:32,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-19 00:37:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 122. [2024-11-19 00:37:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:37:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2024-11-19 00:37:32,099 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 190 [2024-11-19 00:37:32,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:32,101 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2024-11-19 00:37:32,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:32,101 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2024-11-19 00:37:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:32,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:32,103 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:32,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:37:32,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:32,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1611297297, now seen corresponding path program 1 times [2024-11-19 00:37:32,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:32,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404165755] [2024-11-19 00:37:32,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:37:33,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:33,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404165755] [2024-11-19 00:37:33,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404165755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:33,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:33,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:37:33,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549916811] [2024-11-19 00:37:33,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:33,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:37:33,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:33,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:37:33,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:33,504 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:37:33,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:33,733 INFO L93 Difference]: Finished difference Result 297 states and 421 transitions. [2024-11-19 00:37:33,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:37:33,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2024-11-19 00:37:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:33,736 INFO L225 Difference]: With dead ends: 297 [2024-11-19 00:37:33,736 INFO L226 Difference]: Without dead ends: 178 [2024-11-19 00:37:33,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:37:33,738 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 66 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:33,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 994 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:37:33,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-19 00:37:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2024-11-19 00:37:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 146 states have internal predecessors, (193), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 00:37:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 247 transitions. [2024-11-19 00:37:33,758 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 247 transitions. Word has length 190 [2024-11-19 00:37:33,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:33,760 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 247 transitions. [2024-11-19 00:37:33,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:37:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 247 transitions. [2024-11-19 00:37:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:33,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:33,763 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:33,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:37:33,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:33,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:33,764 INFO L85 PathProgramCache]: Analyzing trace with hash 689525293, now seen corresponding path program 1 times [2024-11-19 00:37:33,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:33,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837031785] [2024-11-19 00:37:33,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:33,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-19 00:37:34,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:34,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837031785] [2024-11-19 00:37:34,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837031785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:34,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270808488] [2024-11-19 00:37:34,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:34,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:34,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:34,359 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-19 00:37:34,360 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-19 00:37:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:34,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 00:37:34,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:34,680 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-19 00:37:35,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:35,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 14 [2024-11-19 00:37:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 383 proven. 117 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2024-11-19 00:37:35,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:37:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-19 00:37:36,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270808488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:37:36,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:37:36,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 13] total 24 [2024-11-19 00:37:36,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133925775] [2024-11-19 00:37:36,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:37:36,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 00:37:36,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:36,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 00:37:36,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:37:36,092 INFO L87 Difference]: Start difference. First operand 175 states and 247 transitions. Second operand has 24 states, 19 states have (on average 6.684210526315789) internal successors, (127), 24 states have internal predecessors, (127), 10 states have call successors, (72), 3 states have call predecessors, (72), 7 states have return successors, (72), 5 states have call predecessors, (72), 10 states have call successors, (72) [2024-11-19 00:37:37,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:37,149 INFO L93 Difference]: Finished difference Result 371 states and 512 transitions. [2024-11-19 00:37:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 00:37:37,150 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 6.684210526315789) internal successors, (127), 24 states have internal predecessors, (127), 10 states have call successors, (72), 3 states have call predecessors, (72), 7 states have return successors, (72), 5 states have call predecessors, (72), 10 states have call successors, (72) Word has length 190 [2024-11-19 00:37:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:37,152 INFO L225 Difference]: With dead ends: 371 [2024-11-19 00:37:37,152 INFO L226 Difference]: Without dead ends: 199 [2024-11-19 00:37:37,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 366 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=409, Invalid=1661, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 00:37:37,154 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 487 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:37,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1040 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:37:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-19 00:37:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 191. [2024-11-19 00:37:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 157 states have (on average 1.2993630573248407) internal successors, (204), 158 states have internal predecessors, (204), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 00:37:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 258 transitions. [2024-11-19 00:37:37,164 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 258 transitions. Word has length 190 [2024-11-19 00:37:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:37,165 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 258 transitions. [2024-11-19 00:37:37,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 6.684210526315789) internal successors, (127), 24 states have internal predecessors, (127), 10 states have call successors, (72), 3 states have call predecessors, (72), 7 states have return successors, (72), 5 states have call predecessors, (72), 10 states have call successors, (72) [2024-11-19 00:37:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 258 transitions. [2024-11-19 00:37:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 00:37:37,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:37,167 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:37,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:37:37,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 00:37:37,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:37,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1201331910, now seen corresponding path program 1 times [2024-11-19 00:37:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:37,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126268078] [2024-11-19 00:37:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:37,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:37:37,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:37:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:37:37,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:37:37,740 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:37:37,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:37:37,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:37:37,746 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:37:37,856 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:37:37,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:37:37 BoogieIcfgContainer [2024-11-19 00:37:37,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:37:37,863 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:37:37,863 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:37:37,863 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:37:37,863 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:29" (3/4) ... [2024-11-19 00:37:37,869 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:37:37,870 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:37:37,870 INFO L158 Benchmark]: Toolchain (without parser) took 9416.81ms. Allocated memory was 182.5MB in the beginning and 402.7MB in the end (delta: 220.2MB). Free memory was 113.2MB in the beginning and 345.9MB in the end (delta: -232.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:37:37,870 INFO L158 Benchmark]: CDTParser took 1.22ms. Allocated memory is still 109.1MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:37:37,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.61ms. Allocated memory is still 182.5MB. Free memory was 112.9MB in the beginning and 95.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:37:37,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.05ms. Allocated memory is still 182.5MB. Free memory was 95.5MB in the beginning and 90.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:37:37,871 INFO L158 Benchmark]: Boogie Preprocessor took 66.10ms. Allocated memory is still 182.5MB. Free memory was 90.7MB in the beginning and 84.2MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 00:37:37,871 INFO L158 Benchmark]: RCFGBuilder took 677.25ms. Allocated memory is still 182.5MB. Free memory was 84.2MB in the beginning and 120.7MB in the end (delta: -36.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 00:37:37,871 INFO L158 Benchmark]: TraceAbstraction took 8243.36ms. Allocated memory was 182.5MB in the beginning and 402.7MB in the end (delta: 220.2MB). Free memory was 119.9MB in the beginning and 345.9MB in the end (delta: -226.1MB). Peak memory consumption was 213.3MB. Max. memory is 16.1GB. [2024-11-19 00:37:37,871 INFO L158 Benchmark]: Witness Printer took 7.34ms. Allocated memory is still 402.7MB. Free memory is still 345.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:37:37,875 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22ms. Allocated memory is still 109.1MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.61ms. Allocated memory is still 182.5MB. Free memory was 112.9MB in the beginning and 95.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.05ms. Allocated memory is still 182.5MB. Free memory was 95.5MB in the beginning and 90.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.10ms. Allocated memory is still 182.5MB. Free memory was 90.7MB in the beginning and 84.2MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 677.25ms. Allocated memory is still 182.5MB. Free memory was 84.2MB in the beginning and 120.7MB in the end (delta: -36.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8243.36ms. Allocated memory was 182.5MB in the beginning and 402.7MB in the end (delta: 220.2MB). Free memory was 119.9MB in the beginning and 345.9MB in the end (delta: -226.1MB). Peak memory consumption was 213.3MB. Max. memory is 16.1GB. * Witness Printer took 7.34ms. Allocated memory is still 402.7MB. Free memory is still 345.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 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L25-L27] double double_Array_0[1] = { 32.5 }; [L25-L27] double double_Array_0[1] = { 32.5 }; [L28-L30] float float_Array_0[2] = { 255.5, 255.5 }; [L28-L30] float float_Array_0[2] = { 255.5, 255.5 }; [L28-L30] float float_Array_0[2] = { 255.5, 255.5 }; [L31-L33] signed char signed_char_Array_0[1] = { 0 }; [L31-L33] signed char signed_char_Array_0[1] = { 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 64 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 64 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] FCALL updateLastVariables() [L119] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] float_Array_0[1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L81] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L87] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] unsigned_char_Array_0[6] = __VERIFIER_nondet_uchar() [L93] EXPR unsigned_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[6] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[6] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] EXPR unsigned_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] unsigned_char_Array_0[7] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[7] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[7] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[7] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR unsigned_char_Array_0[7] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[7] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[7] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] unsigned_char_Array_0[8] = __VERIFIER_nondet_uchar() [L99] EXPR unsigned_char_Array_0[8] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[8] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[8] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR unsigned_char_Array_0[8] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[8] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[8] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] unsigned_char_Array_0[9] = __VERIFIER_nondet_uchar() [L102] EXPR unsigned_char_Array_0[9] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L102] CALL assume_abort_if_not(unsigned_char_Array_0[9] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L102] RET assume_abort_if_not(unsigned_char_Array_0[9] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] EXPR unsigned_char_Array_0[9] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] CALL assume_abort_if_not(unsigned_char_Array_0[9] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] RET assume_abort_if_not(unsigned_char_Array_0[9] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L104] unsigned_char_Array_0[10] = __VERIFIER_nondet_uchar() [L105] EXPR unsigned_char_Array_0[10] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] CALL assume_abort_if_not(unsigned_char_Array_0[10] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] RET assume_abort_if_not(unsigned_char_Array_0[10] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L106] EXPR unsigned_char_Array_0[10] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[10] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[10] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L119] RET updateVariables() [L120] CALL step() [L43] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] COND TRUE BOOL_unsigned_char_Array_0[0][0] [L44] EXPR unsigned_char_Array_0[3] [L44] EXPR unsigned_char_Array_0[0] [L44] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] EXPR ((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]) [L44] EXPR unsigned_char_Array_0[0] [L44] EXPR ((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] unsigned_char_Array_0[4] = (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))) [L48] EXPR BOOL_unsigned_char_Array_0[0][0] [L48] EXPR BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] EXPR BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1]; [L49] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L49] COND TRUE BOOL_unsigned_char_Array_0[1][0] || stepLocal_0 [L50] EXPR unsigned_char_Array_0[9] [L50] signed_char_Array_0[0] = unsigned_char_Array_0[9] [L52] EXPR float_Array_0[1] [L52] float_Array_0[0] = float_Array_0[1] [L53] EXPR unsigned_char_Array_0[10] [L53] unsigned_short_int_Array_0[0] = unsigned_char_Array_0[10] [L54] double_Array_0[0] = 0.010000000000000009 [L55] EXPR float_Array_0[0] [L55] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] COND FALSE !(float_Array_0[0] < float_Array_0[0]) [L58] EXPR float_Array_0[0] [L58] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE float_Array_0[0] >= float_Array_0[0] [L59] EXPR BOOL_unsigned_char_Array_0[1][0] [L59] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][0] [L64] EXPR double_Array_0[0] [L64] EXPR float_Array_0[0] [L64] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] EXPR ((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0]) [L64] EXPR float_Array_0[0] [L64] EXPR ((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND TRUE double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0]))) [L65] EXPR unsigned_char_Array_0[2] [L65] EXPR unsigned_char_Array_0[3] [L65] unsigned_char_Array_0[5] = (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]) [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR float_Array_0[0] [L111] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))) [L111] EXPR float_Array_0[0] [L111] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])) [L111] EXPR BOOL_unsigned_char_Array_0[1][1] [L111] EXPR BOOL_unsigned_char_Array_0[0][0] [L111] EXPR (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))) && (double_Array_0[0] == ((double) 0.010000000000000009)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))) && (double_Array_0[0] == ((double) 0.010000000000000009)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111-L112] return (((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))) && (double_Array_0[0] == ((double) 0.010000000000000009)) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 626 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 625 mSDsluCounter, 3749 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2831 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1047 IncrementalHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 918 mSDtfsCounter, 1047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 569 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 65 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1712 NumberOfCodeBlocks, 1712 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1701 ConstructedInterpolants, 0 QuantifiedInterpolants, 6515 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1369 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10446/10800 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-19 00:37:37,910 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-61.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 9d4c4ba5fceaa6bfb2098951964c33b59994f146ab7abe517b65f1a8d594c6fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:37:39,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:37:39,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:37:39,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:37:39,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:37:39,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:37:39,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:37:39,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:37:39,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:37:39,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:37:39,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:37:39,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:37:39,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:37:39,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:37:39,951 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:37:39,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:37:39,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:37:39,952 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:37:39,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:37:39,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:37:39,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:37:39,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:37:39,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:37:39,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:37:39,958 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:37:39,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:37:39,959 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:37:39,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:37:39,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:37:39,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:37:39,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:37:39,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:37:39,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:37:39,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:37:39,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:37:39,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:37:39,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:37:39,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:37:39,960 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:37:39,960 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:37:39,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:37:39,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:37:39,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:37:39,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:37:39,963 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 -> 9d4c4ba5fceaa6bfb2098951964c33b59994f146ab7abe517b65f1a8d594c6fc [2024-11-19 00:37:40,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:37:40,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:37:40,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:37:40,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:37:40,246 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:37:40,247 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-61.i [2024-11-19 00:37:41,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:37:41,780 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:37:41,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2024-11-19 00:37:41,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6babc51/27052bf73624475da957be24c4fba86f/FLAG6804858bc [2024-11-19 00:37:41,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6babc51/27052bf73624475da957be24c4fba86f [2024-11-19 00:37:41,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:37:41,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:37:41,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:37:41,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:37:41,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:37:41,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:37:41" (1/1) ... [2024-11-19 00:37:41,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bda8181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:41, skipping insertion in model container [2024-11-19 00:37:41,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:37:41" (1/1) ... [2024-11-19 00:37:41,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:37:41,998 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-61.i[916,929] [2024-11-19 00:37:42,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:37:42,088 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:37:42,099 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-61.i[916,929] [2024-11-19 00:37:42,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:37:42,172 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:37:42,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42 WrapperNode [2024-11-19 00:37:42,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:37:42,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:37:42,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:37:42,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:37:42,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (1/1) ... [2024-11-19 00:37:42,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (1/1) ... [2024-11-19 00:37:42,234 INFO L138 Inliner]: procedures = 37, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 513 [2024-11-19 00:37:42,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:37:42,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:37:42,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:37:42,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:37:42,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (1/1) ... [2024-11-19 00:37:42,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (1/1) ... [2024-11-19 00:37:42,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (1/1) ... [2024-11-19 00:37:42,275 INFO L175 MemorySlicer]: Split 148 memory accesses to 7 slices as follows [2, 35, 5, 27, 3, 73, 3]. 49 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 4, 1, 2, 1, 0, 1]. The 35 writes are split as follows [0, 6, 1, 2, 1, 24, 1]. [2024-11-19 00:37:42,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (1/1) ... [2024-11-19 00:37:42,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (1/1) ... [2024-11-19 00:37:42,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (1/1) ... [2024-11-19 00:37:42,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (1/1) ... [2024-11-19 00:37:42,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (1/1) ... [2024-11-19 00:37:42,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (1/1) ... [2024-11-19 00:37:42,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:37:42,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:37:42,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:37:42,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:37:42,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (1/1) ... [2024-11-19 00:37:42,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:37:42,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:42,346 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-19 00:37:42,348 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-19 00:37:42,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:37:42,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:37:42,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:37:42,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:37:42,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:37:42,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:37:42,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-19 00:37:42,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-19 00:37:42,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:37:42,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-19 00:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-19 00:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:37:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:37:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:37:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:37:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 00:37:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:37:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:37:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:37:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:37:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 00:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-19 00:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 00:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 00:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-19 00:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-19 00:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-19 00:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 00:37:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-19 00:37:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:37:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:37:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:37:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:37:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:37:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 00:37:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-19 00:37:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 00:37:42,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 00:37:42,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#2 [2024-11-19 00:37:42,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#3 [2024-11-19 00:37:42,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#4 [2024-11-19 00:37:42,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#5 [2024-11-19 00:37:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#6 [2024-11-19 00:37:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:37:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:37:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:37:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:37:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:37:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 00:37:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-19 00:37:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:37:42,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:37:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:37:42,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:37:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:37:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:37:42,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:37:42,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:37:42,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:37:42,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:37:42,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 00:37:42,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:37:42,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:37:42,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:37:42,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:37:42,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:37:42,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 00:37:42,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-19 00:37:42,578 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:37:42,580 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:37:43,228 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-19 00:37:43,228 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:37:43,245 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:37:43,246 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:37:43,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:43 BoogieIcfgContainer [2024-11-19 00:37:43,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:37:43,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:37:43,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:37:43,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:37:43,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:37:41" (1/3) ... [2024-11-19 00:37:43,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2794aac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:37:43, skipping insertion in model container [2024-11-19 00:37:43,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:42" (2/3) ... [2024-11-19 00:37:43,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2794aac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:37:43, skipping insertion in model container [2024-11-19 00:37:43,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:43" (3/3) ... [2024-11-19 00:37:43,253 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-61.i [2024-11-19 00:37:43,266 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:37:43,267 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:37:43,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:37:43,312 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;@42ba1cff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:37:43,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:37:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:37:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:43,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:43,333 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:43,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:43,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:43,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1550515261, now seen corresponding path program 1 times [2024-11-19 00:37:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:43,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056730275] [2024-11-19 00:37:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:43,352 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-19 00:37:43,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:43,358 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-19 00:37:43,359 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-19 00:37:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:43,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:37:43,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-11-19 00:37:43,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:43,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:43,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056730275] [2024-11-19 00:37:43,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056730275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:43,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:43,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:37:43,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023734020] [2024-11-19 00:37:43,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:43,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:37:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:43,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:37:43,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:37:43,776 INFO L87 Difference]: Start difference. First operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:37:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:43,813 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2024-11-19 00:37:43,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:37:43,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2024-11-19 00:37:43,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:43,822 INFO L225 Difference]: With dead ends: 233 [2024-11-19 00:37:43,822 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 00:37:43,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 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-19 00:37:43,830 INFO L432 NwaCegarLoop]: 168 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, 168 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-19 00:37:43,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 00:37:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-19 00:37:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:37:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-19 00:37:43,877 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 190 [2024-11-19 00:37:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:43,878 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-19 00:37:43,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:37:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-19 00:37:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:43,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:43,881 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:43,888 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-19 00:37:44,084 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-19 00:37:44,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:44,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:44,086 INFO L85 PathProgramCache]: Analyzing trace with hash 615561193, now seen corresponding path program 1 times [2024-11-19 00:37:44,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:44,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363855771] [2024-11-19 00:37:44,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:44,087 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-19 00:37:44,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:44,090 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-19 00:37:44,092 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-19 00:37:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:44,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:37:44,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:37:44,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:44,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:44,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363855771] [2024-11-19 00:37:44,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363855771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:44,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:44,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:37:44,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655424366] [2024-11-19 00:37:44,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:44,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:37:44,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:44,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:37:44,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:37:44,492 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:44,647 INFO L93 Difference]: Finished difference Result 279 states and 406 transitions. [2024-11-19 00:37:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:37:44,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-11-19 00:37:44,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:44,650 INFO L225 Difference]: With dead ends: 279 [2024-11-19 00:37:44,651 INFO L226 Difference]: Without dead ends: 166 [2024-11-19 00:37:44,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 186 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-19 00:37:44,652 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 70 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:44,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 576 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:37:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-19 00:37:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 118. [2024-11-19 00:37:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:37:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2024-11-19 00:37:44,674 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 190 [2024-11-19 00:37:44,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:44,679 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2024-11-19 00:37:44,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2024-11-19 00:37:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:44,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:44,681 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:44,692 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-19 00:37:44,888 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-19 00:37:44,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:44,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:44,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2001764587, now seen corresponding path program 1 times [2024-11-19 00:37:44,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:44,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419146176] [2024-11-19 00:37:44,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:44,891 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-19 00:37:44,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:44,896 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-19 00:37:44,897 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-19 00:37:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:45,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:37:45,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:37:45,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:45,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:45,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419146176] [2024-11-19 00:37:45,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419146176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:45,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:45,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:37:45,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750438673] [2024-11-19 00:37:45,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:45,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:37:45,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:45,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:37:45,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:37:45,211 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:45,274 INFO L93 Difference]: Finished difference Result 240 states and 347 transitions. [2024-11-19 00:37:45,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:37:45,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-11-19 00:37:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:45,276 INFO L225 Difference]: With dead ends: 240 [2024-11-19 00:37:45,276 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 00:37:45,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 185 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-19 00:37:45,278 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:45,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 784 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 00:37:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-19 00:37:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:37:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2024-11-19 00:37:45,285 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 190 [2024-11-19 00:37:45,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:45,286 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2024-11-19 00:37:45,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:45,286 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2024-11-19 00:37:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:45,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:45,288 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:45,301 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-19 00:37:45,488 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-19 00:37:45,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:45,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:45,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1613144339, now seen corresponding path program 1 times [2024-11-19 00:37:45,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:45,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936613705] [2024-11-19 00:37:45,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:45,491 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-19 00:37:45,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:45,493 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-19 00:37:45,494 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-19 00:37:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:45,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:37:45,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:37:45,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:45,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:45,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936613705] [2024-11-19 00:37:45,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936613705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:45,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:45,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:37:45,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098849820] [2024-11-19 00:37:45,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:45,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:37:45,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:45,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:37:45,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:45,781 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:45,877 INFO L93 Difference]: Finished difference Result 250 states and 356 transitions. [2024-11-19 00:37:45,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:37:45,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-11-19 00:37:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:45,880 INFO L225 Difference]: With dead ends: 250 [2024-11-19 00:37:45,880 INFO L226 Difference]: Without dead ends: 129 [2024-11-19 00:37:45,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:45,881 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:45,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1076 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:37:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-19 00:37:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-19 00:37:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:37:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 180 transitions. [2024-11-19 00:37:45,895 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 180 transitions. Word has length 190 [2024-11-19 00:37:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:45,895 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 180 transitions. [2024-11-19 00:37:45,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 180 transitions. [2024-11-19 00:37:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:45,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:45,899 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:45,907 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-19 00:37:46,099 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-19 00:37:46,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:46,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1611297297, now seen corresponding path program 1 times [2024-11-19 00:37:46,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:46,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90645524] [2024-11-19 00:37:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:46,103 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-19 00:37:46,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:46,108 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-19 00:37:46,109 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-19 00:37:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:46,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 00:37:46,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:47,701 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 121 treesize of output 61 [2024-11-19 00:37:47,718 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 21 treesize of output 10 [2024-11-19 00:37:47,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:47,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 20 [2024-11-19 00:37:47,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:47,933 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 127 treesize of output 49 [2024-11-19 00:37:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-11-19 00:37:48,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:48,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:48,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90645524] [2024-11-19 00:37:48,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90645524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:48,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:48,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:37:48,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243830514] [2024-11-19 00:37:48,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:48,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:37:48,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:48,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:37:48,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:37:48,017 INFO L87 Difference]: Start difference. First operand 128 states and 180 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:37:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:49,842 INFO L93 Difference]: Finished difference Result 379 states and 532 transitions. [2024-11-19 00:37:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:37:49,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2024-11-19 00:37:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:49,846 INFO L225 Difference]: With dead ends: 379 [2024-11-19 00:37:49,846 INFO L226 Difference]: Without dead ends: 254 [2024-11-19 00:37:49,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:37:49,852 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 298 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:49,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 867 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 00:37:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-19 00:37:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2024-11-19 00:37:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 198 states have internal predecessors, (252), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:37:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 352 transitions. [2024-11-19 00:37:49,881 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 352 transitions. Word has length 190 [2024-11-19 00:37:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:49,884 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 352 transitions. [2024-11-19 00:37:49,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:37:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 352 transitions. [2024-11-19 00:37:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:49,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:49,886 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:49,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 00:37:50,086 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-19 00:37:50,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:50,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:50,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1188595471, now seen corresponding path program 1 times [2024-11-19 00:37:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:50,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271776587] [2024-11-19 00:37:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:50,088 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-19 00:37:50,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:50,090 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-19 00:37:50,091 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-19 00:37:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:50,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:37:50,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:50,329 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 19 [2024-11-19 00:37:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:37:50,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:50,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271776587] [2024-11-19 00:37:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271776587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:50,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:50,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:37:50,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461808247] [2024-11-19 00:37:50,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:50,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:37:50,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:50,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:37:50,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:37:50,345 INFO L87 Difference]: Start difference. First operand 251 states and 352 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:50,691 INFO L93 Difference]: Finished difference Result 499 states and 701 transitions. [2024-11-19 00:37:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:37:50,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-11-19 00:37:50,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:50,701 INFO L225 Difference]: With dead ends: 499 [2024-11-19 00:37:50,701 INFO L226 Difference]: Without dead ends: 251 [2024-11-19 00:37:50,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:37:50,708 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:50,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:37:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-19 00:37:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-19 00:37:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 197 states have (on average 1.2690355329949239) internal successors, (250), 198 states have internal predecessors, (250), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:37:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 350 transitions. [2024-11-19 00:37:50,735 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 350 transitions. Word has length 190 [2024-11-19 00:37:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:50,736 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 350 transitions. [2024-11-19 00:37:50,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 350 transitions. [2024-11-19 00:37:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:37:50,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:50,742 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:50,753 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-19 00:37:50,942 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-19 00:37:50,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:50,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:50,943 INFO L85 PathProgramCache]: Analyzing trace with hash -969740753, now seen corresponding path program 1 times [2024-11-19 00:37:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:50,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592010435] [2024-11-19 00:37:50,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:50,944 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-19 00:37:50,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:50,946 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-19 00:37:50,947 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-19 00:37:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:51,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:37:51,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:51,315 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-19 00:37:51,494 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 46 treesize of output 22 [2024-11-19 00:37:51,573 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 46 treesize of output 22 [2024-11-19 00:37:52,645 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 35 treesize of output 19 [2024-11-19 00:37:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 50 proven. 138 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:37:52,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:37:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-11-19 00:37:53,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592010435] [2024-11-19 00:37:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592010435] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:37:53,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:37:53,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-19 00:37:53,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513423598] [2024-11-19 00:37:53,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:37:53,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 00:37:53,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:53,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 00:37:53,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:37:53,019 INFO L87 Difference]: Start difference. First operand 251 states and 350 transitions. Second operand has 18 states, 14 states have (on average 7.928571428571429) internal successors, (111), 16 states have internal predecessors, (111), 6 states have call successors, (50), 4 states have call predecessors, (50), 5 states have return successors, (50), 3 states have call predecessors, (50), 6 states have call successors, (50) [2024-11-19 00:37:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:53,645 INFO L93 Difference]: Finished difference Result 519 states and 713 transitions. [2024-11-19 00:37:53,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 00:37:53,646 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 7.928571428571429) internal successors, (111), 16 states have internal predecessors, (111), 6 states have call successors, (50), 4 states have call predecessors, (50), 5 states have return successors, (50), 3 states have call predecessors, (50), 6 states have call successors, (50) Word has length 190 [2024-11-19 00:37:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:53,648 INFO L225 Difference]: With dead ends: 519 [2024-11-19 00:37:53,648 INFO L226 Difference]: Without dead ends: 271 [2024-11-19 00:37:53,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:37:53,649 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 83 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:53,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 629 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:37:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-19 00:37:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2024-11-19 00:37:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 205 states have (on average 1.248780487804878) internal successors, (256), 206 states have internal predecessors, (256), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:37:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 356 transitions. [2024-11-19 00:37:53,664 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 356 transitions. Word has length 190 [2024-11-19 00:37:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:53,664 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 356 transitions. [2024-11-19 00:37:53,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 7.928571428571429) internal successors, (111), 16 states have internal predecessors, (111), 6 states have call successors, (50), 4 states have call predecessors, (50), 5 states have return successors, (50), 3 states have call predecessors, (50), 6 states have call successors, (50) [2024-11-19 00:37:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 356 transitions. [2024-11-19 00:37:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 00:37:53,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:53,666 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:53,676 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-19 00:37:53,870 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-19 00:37:53,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:53,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash -457934136, now seen corresponding path program 1 times [2024-11-19 00:37:53,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:53,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371810177] [2024-11-19 00:37:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:53,872 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-19 00:37:53,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:53,873 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-19 00:37:53,874 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-19 00:37:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:54,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 00:37:54,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:54,177 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-19 00:37:54,212 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 26 treesize of output 25 [2024-11-19 00:37:54,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:54,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2024-11-19 00:37:55,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:55,048 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 87 treesize of output 39 [2024-11-19 00:37:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-11-19 00:37:55,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:37:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:37:55,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:55,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371810177] [2024-11-19 00:37:55,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371810177] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:55,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:55,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2024-11-19 00:37:55,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896188264] [2024-11-19 00:37:55,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:55,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:37:55,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:55,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:37:55,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:37:55,243 INFO L87 Difference]: Start difference. First operand 263 states and 356 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:55,408 INFO L93 Difference]: Finished difference Result 653 states and 875 transitions. [2024-11-19 00:37:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:37:55,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2024-11-19 00:37:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:55,411 INFO L225 Difference]: With dead ends: 653 [2024-11-19 00:37:55,412 INFO L226 Difference]: Without dead ends: 393 [2024-11-19 00:37:55,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:37:55,413 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 65 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:55,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 735 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:37:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-19 00:37:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 281. [2024-11-19 00:37:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 223 states have (on average 1.251121076233184) internal successors, (279), 224 states have internal predecessors, (279), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:37:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 379 transitions. [2024-11-19 00:37:55,428 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 379 transitions. Word has length 192 [2024-11-19 00:37:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:55,428 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 379 transitions. [2024-11-19 00:37:55,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 379 transitions. [2024-11-19 00:37:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 00:37:55,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:55,430 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:55,443 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-19 00:37:55,634 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-19 00:37:55,635 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:55,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1842888454, now seen corresponding path program 1 times [2024-11-19 00:37:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:55,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355271734] [2024-11-19 00:37:55,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:55,636 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-19 00:37:55,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:55,638 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-19 00:37:55,639 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-19 00:37:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:55,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:37:55,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:56,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 121 treesize of output 61 [2024-11-19 00:37:56,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:56,859 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 148 treesize of output 58 [2024-11-19 00:37:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-11-19 00:37:56,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:37:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:37:57,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355271734] [2024-11-19 00:37:57,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355271734] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:57,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:57,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-19 00:37:57,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021267513] [2024-11-19 00:37:57,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:57,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:37:57,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:57,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:37:57,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:37:57,218 INFO L87 Difference]: Start difference. First operand 281 states and 379 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:57,491 INFO L93 Difference]: Finished difference Result 797 states and 1075 transitions. [2024-11-19 00:37:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:37:57,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2024-11-19 00:37:57,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:57,498 INFO L225 Difference]: With dead ends: 797 [2024-11-19 00:37:57,498 INFO L226 Difference]: Without dead ends: 519 [2024-11-19 00:37:57,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:37:57,500 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 151 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:57,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 590 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:37:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-19 00:37:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 281. [2024-11-19 00:37:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 223 states have (on average 1.242152466367713) internal successors, (277), 224 states have internal predecessors, (277), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:37:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 377 transitions. [2024-11-19 00:37:57,526 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 377 transitions. Word has length 192 [2024-11-19 00:37:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:57,526 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 377 transitions. [2024-11-19 00:37:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 377 transitions. [2024-11-19 00:37:57,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 00:37:57,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:57,528 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:57,536 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 (10)] Ended with exit code 0 [2024-11-19 00:37:57,732 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-19 00:37:57,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:57,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash -358790689, now seen corresponding path program 1 times [2024-11-19 00:37:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:57,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250705076] [2024-11-19 00:37:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:57,734 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-19 00:37:57,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:57,737 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-19 00:37:57,738 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-19 00:37:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:57,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:37:57,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:57,993 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 19 [2024-11-19 00:37:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:37:58,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:58,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:58,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250705076] [2024-11-19 00:37:58,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250705076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:58,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:58,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:37:58,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520189301] [2024-11-19 00:37:58,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:58,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:37:58,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:58,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:37:58,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:37:58,022 INFO L87 Difference]: Start difference. First operand 281 states and 377 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:58,064 INFO L93 Difference]: Finished difference Result 555 states and 745 transitions. [2024-11-19 00:37:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:37:58,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2024-11-19 00:37:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:58,066 INFO L225 Difference]: With dead ends: 555 [2024-11-19 00:37:58,066 INFO L226 Difference]: Without dead ends: 277 [2024-11-19 00:37:58,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:37:58,067 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:58,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:58,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-19 00:37:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-11-19 00:37:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 220 states have internal predecessors, (267), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:37:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 367 transitions. [2024-11-19 00:37:58,099 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 367 transitions. Word has length 192 [2024-11-19 00:37:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:58,100 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 367 transitions. [2024-11-19 00:37:58,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:37:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 367 transitions. [2024-11-19 00:37:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 00:37:58,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:58,104 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:58,116 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-19 00:37:58,305 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-19 00:37:58,305 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:58,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:58,306 INFO L85 PathProgramCache]: Analyzing trace with hash -591947642, now seen corresponding path program 1 times [2024-11-19 00:37:58,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:58,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339225306] [2024-11-19 00:37:58,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:58,307 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-19 00:37:58,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:58,308 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-19 00:37:58,309 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-19 00:37:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:58,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:37:58,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:59,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2024-11-19 00:37:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-11-19 00:37:59,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:37:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:37:59,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:59,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339225306] [2024-11-19 00:37:59,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339225306] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:59,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:59,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-11-19 00:37:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948718799] [2024-11-19 00:37:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:59,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:37:59,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:37:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:37:59,762 INFO L87 Difference]: Start difference. First operand 277 states and 367 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:38:01,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 00:38:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:01,521 INFO L93 Difference]: Finished difference Result 799 states and 1062 transitions. [2024-11-19 00:38:01,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:38:01,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2024-11-19 00:38:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:01,524 INFO L225 Difference]: With dead ends: 799 [2024-11-19 00:38:01,525 INFO L226 Difference]: Without dead ends: 525 [2024-11-19 00:38:01,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:38:01,526 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 145 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:01,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 842 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 00:38:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-19 00:38:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 289. [2024-11-19 00:38:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 231 states have (on average 1.2121212121212122) internal successors, (280), 232 states have internal predecessors, (280), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:38:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 380 transitions. [2024-11-19 00:38:01,569 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 380 transitions. Word has length 192 [2024-11-19 00:38:01,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:01,570 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 380 transitions. [2024-11-19 00:38:01,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:38:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 380 transitions. [2024-11-19 00:38:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 00:38:01,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:01,571 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38: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 (12)] Ended with exit code 0 [2024-11-19 00:38:01,774 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-19 00:38:01,776 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:01,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:01,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1708874948, now seen corresponding path program 1 times [2024-11-19 00:38:01,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:01,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901952119] [2024-11-19 00:38:01,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:01,779 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-19 00:38:01,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:01,781 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-19 00:38:01,795 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-19 00:38:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:02,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 00:38:02,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:03,022 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 121 treesize of output 61 [2024-11-19 00:38:03,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:03,054 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 148 treesize of output 58 [2024-11-19 00:38:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-11-19 00:38:03,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:38:03,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901952119] [2024-11-19 00:38:03,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901952119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:38:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1902841205] [2024-11-19 00:38:03,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:03,328 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:38:03,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:38:03,331 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:38:03,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-19 00:38:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:04,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 00:38:04,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:05,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2024-11-19 00:38:05,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:05,103 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 148 treesize of output 58 [2024-11-19 00:38:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-11-19 00:38:05,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:38:05,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1902841205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:38:05,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:38:05,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2024-11-19 00:38:05,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933185863] [2024-11-19 00:38:05,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:38:05,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:38:05,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:38:05,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:38:05,342 INFO L87 Difference]: Start difference. First operand 289 states and 380 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 9 states have internal predecessors, (81), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:38:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:07,074 INFO L93 Difference]: Finished difference Result 572 states and 753 transitions. [2024-11-19 00:38:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:38:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 9 states have internal predecessors, (81), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 192 [2024-11-19 00:38:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:07,077 INFO L225 Difference]: With dead ends: 572 [2024-11-19 00:38:07,078 INFO L226 Difference]: Without dead ends: 286 [2024-11-19 00:38:07,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 441 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:38:07,079 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 349 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:07,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 966 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 00:38:07,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-19 00:38:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2024-11-19 00:38:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 225 states have (on average 1.208888888888889) internal successors, (272), 226 states have internal predecessors, (272), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:38:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 372 transitions. [2024-11-19 00:38:07,107 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 372 transitions. Word has length 192 [2024-11-19 00:38:07,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:07,108 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 372 transitions. [2024-11-19 00:38:07,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 9 states have internal predecessors, (81), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:38:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 372 transitions. [2024-11-19 00:38:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 00:38:07,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:07,110 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:07,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-19 00:38:07,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 00:38:07,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-19 00:38:07,515 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1562213308, now seen corresponding path program 1 times [2024-11-19 00:38:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:07,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687476856] [2024-11-19 00:38:07,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:07,516 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-19 00:38:07,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:07,520 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-19 00:38:07,521 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-19 00:38:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:07,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:38:07,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-11-19 00:38:07,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:07,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:07,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687476856] [2024-11-19 00:38:07,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687476856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:07,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:07,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:38:07,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727812857] [2024-11-19 00:38:07,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:07,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:38:07,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:07,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:38:07,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:38:07,770 INFO L87 Difference]: Start difference. First operand 283 states and 372 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:38:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:07,802 INFO L93 Difference]: Finished difference Result 563 states and 741 transitions. [2024-11-19 00:38:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:38:07,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 192 [2024-11-19 00:38:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:07,804 INFO L225 Difference]: With dead ends: 563 [2024-11-19 00:38:07,804 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 00:38:07,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 189 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-19 00:38:07,805 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 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-19 00:38:07,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 00:38:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-19 00:38:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 225 states have (on average 1.2044444444444444) internal successors, (271), 226 states have internal predecessors, (271), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:38:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 371 transitions. [2024-11-19 00:38:07,819 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 371 transitions. Word has length 192 [2024-11-19 00:38:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:07,820 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 371 transitions. [2024-11-19 00:38:07,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:38:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 371 transitions. [2024-11-19 00:38:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-19 00:38:07,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:07,821 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:07,831 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-19 00:38:08,024 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-19 00:38:08,025 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:08,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:08,025 INFO L85 PathProgramCache]: Analyzing trace with hash -242044291, now seen corresponding path program 1 times [2024-11-19 00:38:08,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:08,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54499940] [2024-11-19 00:38:08,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:08,026 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-19 00:38:08,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:08,027 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-19 00:38:08,029 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-19 00:38:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:08,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:38:08,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:08,498 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-19 00:38:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 414 proven. 57 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2024-11-19 00:38:08,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:38:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-19 00:38:08,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:08,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54499940] [2024-11-19 00:38:08,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54499940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:38:08,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:38:08,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-19 00:38:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641353470] [2024-11-19 00:38:08,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:38:08,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:38:08,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:08,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:38:08,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:38:08,765 INFO L87 Difference]: Start difference. First operand 283 states and 371 transitions. Second operand has 10 states, 8 states have (on average 10.125) internal successors, (81), 10 states have internal predecessors, (81), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) [2024-11-19 00:38:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:09,165 INFO L93 Difference]: Finished difference Result 581 states and 755 transitions. [2024-11-19 00:38:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:38:09,166 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 10.125) internal successors, (81), 10 states have internal predecessors, (81), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) Word has length 193 [2024-11-19 00:38:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:09,168 INFO L225 Difference]: With dead ends: 581 [2024-11-19 00:38:09,168 INFO L226 Difference]: Without dead ends: 301 [2024-11-19 00:38:09,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:38:09,169 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 211 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:09,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 495 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:38:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-19 00:38:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 283. [2024-11-19 00:38:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 226 states have (on average 1.1946902654867257) internal successors, (270), 227 states have internal predecessors, (270), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:38:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 366 transitions. [2024-11-19 00:38:09,186 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 366 transitions. Word has length 193 [2024-11-19 00:38:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:09,186 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 366 transitions. [2024-11-19 00:38:09,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 10.125) internal successors, (81), 10 states have internal predecessors, (81), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) [2024-11-19 00:38:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 366 transitions. [2024-11-19 00:38:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-19 00:38:09,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:09,187 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:09,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 00:38:09,391 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-19 00:38:09,392 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:09,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash -101495681, now seen corresponding path program 1 times [2024-11-19 00:38:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:09,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954624813] [2024-11-19 00:38:09,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:09,394 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-19 00:38:09,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:09,397 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-19 00:38:09,398 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-19 00:38:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:09,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:38:09,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:09,705 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 19 [2024-11-19 00:38:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:38:09,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:09,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:09,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954624813] [2024-11-19 00:38:09,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954624813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:09,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:09,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:38:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673054289] [2024-11-19 00:38:09,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:09,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:38:09,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:09,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:38:09,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:38:09,722 INFO L87 Difference]: Start difference. First operand 283 states and 366 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:38:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:09,759 INFO L93 Difference]: Finished difference Result 542 states and 705 transitions. [2024-11-19 00:38:09,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:38:09,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 193 [2024-11-19 00:38:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:09,762 INFO L225 Difference]: With dead ends: 542 [2024-11-19 00:38:09,762 INFO L226 Difference]: Without dead ends: 262 [2024-11-19 00:38:09,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:38:09,765 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:09,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-19 00:38:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-11-19 00:38:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 205 states have (on average 1.1902439024390243) internal successors, (244), 206 states have internal predecessors, (244), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:38:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 340 transitions. [2024-11-19 00:38:09,810 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 340 transitions. Word has length 193 [2024-11-19 00:38:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:09,810 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 340 transitions. [2024-11-19 00:38:09,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:38:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 340 transitions. [2024-11-19 00:38:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-19 00:38:09,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:09,812 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:09,823 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-19 00:38:10,015 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-19 00:38:10,016 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:10,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:10,017 INFO L85 PathProgramCache]: Analyzing trace with hash 552097416, now seen corresponding path program 1 times [2024-11-19 00:38:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:10,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974943883] [2024-11-19 00:38:10,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:10,022 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-19 00:38:10,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:10,025 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-19 00:38:10,028 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-19 00:38:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:10,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 00:38:10,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:10,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 00:38:10,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 00:38:10,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:10,949 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 64 treesize of output 24 [2024-11-19 00:38:11,011 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 62 treesize of output 26 [2024-11-19 00:38:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:38:11,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:11,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:11,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974943883] [2024-11-19 00:38:11,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974943883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:11,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:11,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:38:11,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473640756] [2024-11-19 00:38:11,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:11,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:38:11,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:11,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:38:11,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:38:11,079 INFO L87 Difference]: Start difference. First operand 262 states and 340 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:38:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:13,687 INFO L93 Difference]: Finished difference Result 827 states and 1091 transitions. [2024-11-19 00:38:13,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:38:13,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 194 [2024-11-19 00:38:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:13,693 INFO L225 Difference]: With dead ends: 827 [2024-11-19 00:38:13,693 INFO L226 Difference]: Without dead ends: 568 [2024-11-19 00:38:13,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:38:13,696 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 305 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:13,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1178 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 00:38:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-19 00:38:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 262. [2024-11-19 00:38:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 205 states have (on average 1.1853658536585365) internal successors, (243), 206 states have internal predecessors, (243), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:38:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 339 transitions. [2024-11-19 00:38:13,737 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 339 transitions. Word has length 194 [2024-11-19 00:38:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:13,738 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 339 transitions. [2024-11-19 00:38:13,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:38:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 339 transitions. [2024-11-19 00:38:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-19 00:38:13,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:13,740 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:13,754 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 (18)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:13,943 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-19 00:38:13,944 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:13,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash 974799242, now seen corresponding path program 1 times [2024-11-19 00:38:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:13,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282850238] [2024-11-19 00:38:13,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:13,946 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-19 00:38:13,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:13,948 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-19 00:38:13,949 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-19 00:38:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:14,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:38:14,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:15,010 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 119 treesize of output 59 [2024-11-19 00:38:15,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:15,050 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 146 treesize of output 56 [2024-11-19 00:38:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 510 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-19 00:38:15,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:38:15,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282850238] [2024-11-19 00:38:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282850238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:38:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1473869235] [2024-11-19 00:38:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:15,275 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:38:15,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:38:15,281 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:38:15,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-19 00:38:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:16,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 00:38:16,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:16,972 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 119 treesize of output 59 [2024-11-19 00:38:17,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:17,026 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 146 treesize of output 56 [2024-11-19 00:38:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 510 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-19 00:38:17,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:38:17,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1473869235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:38:17,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:38:17,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2024-11-19 00:38:17,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196675188] [2024-11-19 00:38:17,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:38:17,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:38:17,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:17,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:38:17,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:38:17,235 INFO L87 Difference]: Start difference. First operand 262 states and 339 transitions. Second operand has 13 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-19 00:38:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:19,683 INFO L93 Difference]: Finished difference Result 660 states and 850 transitions. [2024-11-19 00:38:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 00:38:19,684 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 194 [2024-11-19 00:38:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:19,686 INFO L225 Difference]: With dead ends: 660 [2024-11-19 00:38:19,686 INFO L226 Difference]: Without dead ends: 401 [2024-11-19 00:38:19,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 441 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=217, Invalid=839, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 00:38:19,689 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 276 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:19,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1094 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 00:38:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-19 00:38:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 323. [2024-11-19 00:38:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 245 states have (on average 1.1714285714285715) internal successors, (287), 246 states have internal predecessors, (287), 67 states have call successors, (67), 10 states have call predecessors, (67), 10 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 00:38:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 421 transitions. [2024-11-19 00:38:19,723 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 421 transitions. Word has length 194 [2024-11-19 00:38:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:19,723 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 421 transitions. [2024-11-19 00:38:19,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-19 00:38:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 421 transitions. [2024-11-19 00:38:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-19 00:38:19,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:19,724 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:19,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-19 00:38:19,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-19 00:38:20,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-19 00:38:20,129 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:20,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash 51631816, now seen corresponding path program 1 times [2024-11-19 00:38:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:20,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423377518] [2024-11-19 00:38:20,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:20,131 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-19 00:38:20,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:20,133 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-19 00:38:20,134 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-19 00:38:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:20,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:38:20,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-19 00:38:20,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:20,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:20,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423377518] [2024-11-19 00:38:20,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423377518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:20,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:20,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:20,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491221087] [2024-11-19 00:38:20,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:20,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:20,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:20,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:20,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:20,397 INFO L87 Difference]: Start difference. First operand 323 states and 421 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-19 00:38:20,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:20,571 INFO L93 Difference]: Finished difference Result 532 states and 689 transitions. [2024-11-19 00:38:20,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:38:20,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 194 [2024-11-19 00:38:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:20,573 INFO L225 Difference]: With dead ends: 532 [2024-11-19 00:38:20,573 INFO L226 Difference]: Without dead ends: 206 [2024-11-19 00:38:20,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:20,574 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:20,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 581 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:20,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-19 00:38:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2024-11-19 00:38:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 146 states have internal predecessors, (168), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 00:38:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 256 transitions. [2024-11-19 00:38:20,594 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 256 transitions. Word has length 194 [2024-11-19 00:38:20,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:20,594 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 256 transitions. [2024-11-19 00:38:20,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-19 00:38:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 256 transitions. [2024-11-19 00:38:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-19 00:38:20,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:20,595 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:20,602 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 (21)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:20,799 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-19 00:38:20,800 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:20,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash -423079745, now seen corresponding path program 1 times [2024-11-19 00:38:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:20,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675390645] [2024-11-19 00:38:20,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:20,801 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-19 00:38:20,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:20,806 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-19 00:38:20,811 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-19 00:38:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:21,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 00:38:21,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:22,285 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 21 treesize of output 10 [2024-11-19 00:38:22,293 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 121 treesize of output 61 [2024-11-19 00:38:22,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:22,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 20 [2024-11-19 00:38:22,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:22,803 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 127 treesize of output 49 [2024-11-19 00:38:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-11-19 00:38:22,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:22,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:22,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675390645] [2024-11-19 00:38:22,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675390645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:22,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:22,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:38:22,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000972349] [2024-11-19 00:38:22,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:22,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:38:22,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:22,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:38:22,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:38:22,914 INFO L87 Difference]: Start difference. First operand 198 states and 256 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:38:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:25,064 INFO L93 Difference]: Finished difference Result 465 states and 595 transitions. [2024-11-19 00:38:25,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:38:25,065 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 195 [2024-11-19 00:38:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:25,066 INFO L225 Difference]: With dead ends: 465 [2024-11-19 00:38:25,066 INFO L226 Difference]: Without dead ends: 270 [2024-11-19 00:38:25,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:38:25,067 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 195 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:25,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1169 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 00:38:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-19 00:38:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 206. [2024-11-19 00:38:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 154 states have (on average 1.1493506493506493) internal successors, (177), 154 states have internal predecessors, (177), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 00:38:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 265 transitions. [2024-11-19 00:38:25,089 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 265 transitions. Word has length 195 [2024-11-19 00:38:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:25,090 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 265 transitions. [2024-11-19 00:38:25,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 00:38:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 265 transitions. [2024-11-19 00:38:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-19 00:38:25,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:25,091 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:25,098 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 (22)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:25,294 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-19 00:38:25,295 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:25,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:25,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1444148099, now seen corresponding path program 1 times [2024-11-19 00:38:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:25,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331167783] [2024-11-19 00:38:25,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:25,296 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-19 00:38:25,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:25,298 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-19 00:38:25,299 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-19 00:38:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:25,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:38:25,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:38:25,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:25,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:25,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331167783] [2024-11-19 00:38:25,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331167783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:25,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:25,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:38:25,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59473708] [2024-11-19 00:38:25,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:25,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:38:25,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:25,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:38:25,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:38:25,614 INFO L87 Difference]: Start difference. First operand 206 states and 265 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:38:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:25,721 INFO L93 Difference]: Finished difference Result 412 states and 531 transitions. [2024-11-19 00:38:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:38:25,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 195 [2024-11-19 00:38:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:25,723 INFO L225 Difference]: With dead ends: 412 [2024-11-19 00:38:25,723 INFO L226 Difference]: Without dead ends: 209 [2024-11-19 00:38:25,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:38:25,724 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:25,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-19 00:38:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-11-19 00:38:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 157 states have (on average 1.1464968152866242) internal successors, (180), 157 states have internal predecessors, (180), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 00:38:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 268 transitions. [2024-11-19 00:38:25,745 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 268 transitions. Word has length 195 [2024-11-19 00:38:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:25,745 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 268 transitions. [2024-11-19 00:38:25,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:38:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 268 transitions. [2024-11-19 00:38:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-19 00:38:25,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:25,746 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:25,756 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-19 00:38:25,947 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-19 00:38:25,947 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:25,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash -35981425, now seen corresponding path program 1 times [2024-11-19 00:38:25,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:25,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072239723] [2024-11-19 00:38:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:25,949 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-19 00:38:25,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:25,951 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-19 00:38:25,955 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-19 00:38:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:26,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:38:26,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:26,302 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 19 [2024-11-19 00:38:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:38:26,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:26,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:26,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072239723] [2024-11-19 00:38:26,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072239723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:26,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:26,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:38:26,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284809140] [2024-11-19 00:38:26,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:26,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:38:26,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:26,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:38:26,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:38:26,320 INFO L87 Difference]: Start difference. First operand 209 states and 268 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:38:26,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:26,478 INFO L93 Difference]: Finished difference Result 415 states and 533 transitions. [2024-11-19 00:38:26,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:38:26,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 197 [2024-11-19 00:38:26,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:26,480 INFO L225 Difference]: With dead ends: 415 [2024-11-19 00:38:26,480 INFO L226 Difference]: Without dead ends: 209 [2024-11-19 00:38:26,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:38:26,482 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:26,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:26,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-19 00:38:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-11-19 00:38:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 157 states have (on average 1.1337579617834395) internal successors, (178), 157 states have internal predecessors, (178), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 00:38:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 266 transitions. [2024-11-19 00:38:26,512 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 266 transitions. Word has length 197 [2024-11-19 00:38:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:26,512 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 266 transitions. [2024-11-19 00:38:26,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 00:38:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 266 transitions. [2024-11-19 00:38:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-19 00:38:26,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:26,514 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:26,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-19 00:38:26,714 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-19 00:38:26,715 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:26,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1724925167, now seen corresponding path program 1 times [2024-11-19 00:38:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:26,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942955551] [2024-11-19 00:38:26,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:26,716 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-19 00:38:26,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:26,718 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-19 00:38:26,719 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-19 00:38:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:27,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 00:38:27,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:27,205 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-19 00:38:27,342 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 46 treesize of output 22 [2024-11-19 00:38:27,398 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 46 treesize of output 22 [2024-11-19 00:38:28,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:28,083 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 48 treesize of output 42 [2024-11-19 00:38:28,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:28,231 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 52 treesize of output 24 [2024-11-19 00:38:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 50 proven. 138 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:38:28,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:38:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-11-19 00:38:28,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:28,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942955551] [2024-11-19 00:38:28,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942955551] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:38:28,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:38:28,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2024-11-19 00:38:28,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327297022] [2024-11-19 00:38:28,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:38:28,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 00:38:28,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:28,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 00:38:28,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:38:28,584 INFO L87 Difference]: Start difference. First operand 209 states and 266 transitions. Second operand has 19 states, 15 states have (on average 9.466666666666667) internal successors, (142), 17 states have internal predecessors, (142), 6 states have call successors, (50), 4 states have call predecessors, (50), 5 states have return successors, (50), 3 states have call predecessors, (50), 6 states have call successors, (50) [2024-11-19 00:38:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:29,248 INFO L93 Difference]: Finished difference Result 425 states and 539 transitions. [2024-11-19 00:38:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 00:38:29,248 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 9.466666666666667) internal successors, (142), 17 states have internal predecessors, (142), 6 states have call successors, (50), 4 states have call predecessors, (50), 5 states have return successors, (50), 3 states have call predecessors, (50), 6 states have call successors, (50) Word has length 197 [2024-11-19 00:38:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:29,250 INFO L225 Difference]: With dead ends: 425 [2024-11-19 00:38:29,250 INFO L226 Difference]: Without dead ends: 219 [2024-11-19 00:38:29,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2024-11-19 00:38:29,251 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 134 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:29,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 723 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:38:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-19 00:38:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 209. [2024-11-19 00:38:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 157 states have (on average 1.127388535031847) internal successors, (177), 157 states have internal predecessors, (177), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 00:38:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 265 transitions. [2024-11-19 00:38:29,277 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 265 transitions. Word has length 197 [2024-11-19 00:38:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:29,277 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 265 transitions. [2024-11-19 00:38:29,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 9.466666666666667) internal successors, (142), 17 states have internal predecessors, (142), 6 states have call successors, (50), 4 states have call predecessors, (50), 5 states have return successors, (50), 3 states have call predecessors, (50), 6 states have call successors, (50) [2024-11-19 00:38:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 265 transitions. [2024-11-19 00:38:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-19 00:38:29,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:29,282 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:29,293 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 (25)] Ended with exit code 0 [2024-11-19 00:38:29,482 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-19 00:38:29,483 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:29,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash -753300355, now seen corresponding path program 1 times [2024-11-19 00:38:29,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:29,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410874422] [2024-11-19 00:38:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:29,484 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-19 00:38:29,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:29,486 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-19 00:38:29,487 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-19 00:38:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:29,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 00:38:29,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:29,924 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-19 00:38:29,927 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-19 00:38:29,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-19 00:38:29,999 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-19 00:38:30,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:30,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-19 00:38:30,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:30,120 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 35 treesize of output 37 [2024-11-19 00:38:30,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:30,227 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 45 treesize of output 50 [2024-11-19 00:38:30,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:30,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 60 treesize of output 53 [2024-11-19 00:38:30,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:30,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 80 [2024-11-19 00:38:30,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:30,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 145 treesize of output 67 [2024-11-19 00:38:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-19 00:38:30,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:30,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:30,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410874422] [2024-11-19 00:38:30,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410874422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:30,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:30,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:38:30,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84463569] [2024-11-19 00:38:30,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:30,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:38:30,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:30,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:38:30,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:38:30,683 INFO L87 Difference]: Start difference. First operand 209 states and 265 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-19 00:38:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:31,738 INFO L93 Difference]: Finished difference Result 527 states and 660 transitions. [2024-11-19 00:38:31,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:38:31,738 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 197 [2024-11-19 00:38:31,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:31,741 INFO L225 Difference]: With dead ends: 527 [2024-11-19 00:38:31,741 INFO L226 Difference]: Without dead ends: 321 [2024-11-19 00:38:31,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:38:31,744 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 309 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:31,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 736 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:38:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-19 00:38:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 314. [2024-11-19 00:38:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 239 states have (on average 1.1338912133891212) internal successors, (271), 241 states have internal predecessors, (271), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-19 00:38:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 391 transitions. [2024-11-19 00:38:31,804 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 391 transitions. Word has length 197 [2024-11-19 00:38:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:31,804 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 391 transitions. [2024-11-19 00:38:31,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-19 00:38:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 391 transitions. [2024-11-19 00:38:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-19 00:38:31,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:31,805 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:31,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:32,006 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-19 00:38:32,006 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:32,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash -887313861, now seen corresponding path program 1 times [2024-11-19 00:38:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:32,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64162682] [2024-11-19 00:38:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:32,007 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-19 00:38:32,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:32,009 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-19 00:38:32,010 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-19 00:38:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:32,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 00:38:32,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:33,053 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 21 treesize of output 10 [2024-11-19 00:38:33,060 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 90 treesize of output 48 [2024-11-19 00:38:35,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:35,964 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 122 treesize of output 56 [2024-11-19 00:38:36,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:36,733 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 135 treesize of output 63 [2024-11-19 00:38:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 54 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-19 00:38:38,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:38:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 00:38:47,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:47,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64162682] [2024-11-19 00:38:47,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64162682] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:38:47,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:38:47,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2024-11-19 00:38:47,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451603132] [2024-11-19 00:38:47,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:47,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:38:47,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:47,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:38:47,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:38:47,813 INFO L87 Difference]: Start difference. First operand 314 states and 391 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)