./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.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 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:21:21,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:21:21,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:21:21,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:21:21,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:21:21,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:21:21,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:21:21,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:21:21,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:21:21,882 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:21:21,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:21:21,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:21:21,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:21:21,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:21:21,884 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:21:21,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:21:21,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:21:21,887 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:21:21,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:21:21,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:21:21,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:21:21,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:21:21,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:21:21,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:21:21,890 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:21:21,890 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:21:21,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:21:21,890 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:21:21,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:21:21,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:21:21,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:21:21,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:21:21,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:21:21,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:21:21,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:21:21,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:21:21,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:21:21,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:21:21,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:21:21,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:21:21,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:21:21,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:21:21,894 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 -> 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 [2024-10-24 11:21:22,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:21:22,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:21:22,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:21:22,139 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:21:22,139 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:21:22,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2024-10-24 11:21:23,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:21:23,443 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:21:23,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2024-10-24 11:21:23,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d924e16a/ccb554d35d0d4cb68a5ee1682c8cc14f/FLAG895f6ca52 [2024-10-24 11:21:23,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d924e16a/ccb554d35d0d4cb68a5ee1682c8cc14f [2024-10-24 11:21:23,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:21:23,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:21:23,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:21:23,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:21:23,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:21:23,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d1b1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23, skipping insertion in model container [2024-10-24 11:21:23,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:21:23,647 WARN L248 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-86.i[916,929] [2024-10-24 11:21:23,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:21:23,742 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:21:23,750 WARN L248 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-86.i[916,929] [2024-10-24 11:21:23,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:21:23,804 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:21:23,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23 WrapperNode [2024-10-24 11:21:23,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:21:23,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:21:23,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:21:23,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:21:23,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,864 INFO L138 Inliner]: procedures = 29, calls = 247, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 770 [2024-10-24 11:21:23,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:21:23,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:21:23,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:21:23,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:21:23,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,908 INFO L175 MemorySlicer]: Split 206 memory accesses to 6 slices as follows [2, 14, 27, 43, 5, 115]. 56 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 5, 1, 6]. The 21 writes are split as follows [0, 2, 4, 6, 1, 8]. [2024-10-24 11:21:23,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:21:23,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:21:23,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:21:23,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:21:23,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (1/1) ... [2024-10-24 11:21:23,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:21:23,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:21:24,003 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-10-24 11:21:24,009 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-10-24 11:21:24,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:21:24,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:21:24,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:21:24,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:21:24,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:21:24,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:21:24,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:21:24,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:21:24,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:21:24,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:21:24,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:21:24,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:21:24,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:21:24,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:21:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:21:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:21:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:21:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:21:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:21:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:21:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:21:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:21:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:21:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:21:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:21:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:21:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:21:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:21:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:21:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:21:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:21:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:21:24,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:21:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:21:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:21:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:21:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:21:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:21:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:21:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:21:24,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:21:24,178 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:21:24,179 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:21:24,699 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2024-10-24 11:21:24,700 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:21:24,728 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:21:24,730 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:21:24,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:21:24 BoogieIcfgContainer [2024-10-24 11:21:24,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:21:24,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:21:24,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:21:24,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:21:24,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:21:23" (1/3) ... [2024-10-24 11:21:24,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328dcdac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:21:24, skipping insertion in model container [2024-10-24 11:21:24,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:23" (2/3) ... [2024-10-24 11:21:24,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328dcdac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:21:24, skipping insertion in model container [2024-10-24 11:21:24,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:21:24" (3/3) ... [2024-10-24 11:21:24,737 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-86.i [2024-10-24 11:21:24,748 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:21:24,749 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:21:24,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:21:24,797 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;@ddcf615, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:21:24,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:21:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 124 states have (on average 1.4596774193548387) internal successors, (181), 125 states have internal predecessors, (181), 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-10-24 11:21:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-24 11:21:24,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:24,811 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] [2024-10-24 11:21:24,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:24,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash 168979323, now seen corresponding path program 1 times [2024-10-24 11:21:24,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:24,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300206409] [2024-10-24 11:21:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:24,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:21:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:21:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:21:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:21:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:21:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:21:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:21:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:21:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:21:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:21:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:21:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:21:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:21:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:21:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:21:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:21:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:21:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:21:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:21:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 11:21:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 11:21:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 11:21:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 11:21:25,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:25,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300206409] [2024-10-24 11:21:25,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300206409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:25,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:25,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:21:25,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652390253] [2024-10-24 11:21:25,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:25,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:21:25,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:25,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:21:25,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:21:25,199 INFO L87 Difference]: Start difference. First operand has 152 states, 124 states have (on average 1.4596774193548387) internal successors, (181), 125 states have internal predecessors, (181), 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 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-10-24 11:21:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:25,239 INFO L93 Difference]: Finished difference Result 301 states and 485 transitions. [2024-10-24 11:21:25,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:21:25,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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 180 [2024-10-24 11:21:25,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:25,247 INFO L225 Difference]: With dead ends: 301 [2024-10-24 11:21:25,247 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 11:21:25,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-10-24 11:21:25,252 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 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-10-24 11:21:25,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 11:21:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-24 11:21:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 123 states have internal predecessors, (176), 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-10-24 11:21:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2024-10-24 11:21:25,303 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 180 [2024-10-24 11:21:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:25,303 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2024-10-24 11:21:25,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-10-24 11:21:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2024-10-24 11:21:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-24 11:21:25,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:25,306 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] [2024-10-24 11:21:25,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:21:25,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:25,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:25,307 INFO L85 PathProgramCache]: Analyzing trace with hash -426312103, now seen corresponding path program 1 times [2024-10-24 11:21:25,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:25,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107306930] [2024-10-24 11:21:25,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:25,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:21:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:21:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:21:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:21:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:21:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:21:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:21:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:21:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:21:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:21:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:21:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:21:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:21:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:21:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:21:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:21:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:21:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:21:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:21:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 11:21:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 11:21:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 11:21:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 11:21:25,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:25,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107306930] [2024-10-24 11:21:25,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107306930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:25,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:25,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616931494] [2024-10-24 11:21:25,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:25,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:21:25,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:25,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:21:25,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:25,685 INFO L87 Difference]: Start difference. First operand 150 states and 226 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 11:21:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:25,743 INFO L93 Difference]: Finished difference Result 301 states and 454 transitions. [2024-10-24 11:21:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:25,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 180 [2024-10-24 11:21:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:25,745 INFO L225 Difference]: With dead ends: 301 [2024-10-24 11:21:25,745 INFO L226 Difference]: Without dead ends: 152 [2024-10-24 11:21:25,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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-10-24 11:21:25,747 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:25,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 653 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-24 11:21:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-10-24 11:21:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 125 states have (on average 1.424) internal successors, (178), 125 states have internal predecessors, (178), 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-10-24 11:21:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 228 transitions. [2024-10-24 11:21:25,768 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 228 transitions. Word has length 180 [2024-10-24 11:21:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:25,770 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 228 transitions. [2024-10-24 11:21:25,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 11:21:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 228 transitions. [2024-10-24 11:21:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-24 11:21:25,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:25,776 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] [2024-10-24 11:21:25,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:21:25,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:25,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash -844200805, now seen corresponding path program 1 times [2024-10-24 11:21:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:25,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094415055] [2024-10-24 11:21:25,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:25,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:21:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:21:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:21:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:21:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:21:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:21:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:21:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:21:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:21:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:21:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:21:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:21:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:21:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:21:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:21:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:21:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:21:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:21:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:21:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 11:21:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 11:21:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 11:21:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 11:21:25,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:25,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094415055] [2024-10-24 11:21:25,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094415055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:25,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:25,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:25,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681221780] [2024-10-24 11:21:25,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:25,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:21:25,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:25,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:21:25,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:25,993 INFO L87 Difference]: Start difference. First operand 152 states and 228 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-10-24 11:21:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:26,032 INFO L93 Difference]: Finished difference Result 306 states and 459 transitions. [2024-10-24 11:21:26,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:26,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 180 [2024-10-24 11:21:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:26,034 INFO L225 Difference]: With dead ends: 306 [2024-10-24 11:21:26,035 INFO L226 Difference]: Without dead ends: 155 [2024-10-24 11:21:26,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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-10-24 11:21:26,040 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 1 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:26,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 653 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-24 11:21:26,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-10-24 11:21:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 127 states have (on average 1.4173228346456692) internal successors, (180), 127 states have internal predecessors, (180), 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-10-24 11:21:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 230 transitions. [2024-10-24 11:21:26,054 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 230 transitions. Word has length 180 [2024-10-24 11:21:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:26,056 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 230 transitions. [2024-10-24 11:21:26,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-10-24 11:21:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 230 transitions. [2024-10-24 11:21:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-24 11:21:26,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:26,060 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] [2024-10-24 11:21:26,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:21:26,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:26,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash -844141223, now seen corresponding path program 1 times [2024-10-24 11:21:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:26,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413135075] [2024-10-24 11:21:26,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:21:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:21:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:21:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:21:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:21:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:21:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:21:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:21:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:21:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:21:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:21:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:21:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:21:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:21:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:21:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:21:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:21:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:21:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:21:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 11:21:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 11:21:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 11:21:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 11:21:26,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413135075] [2024-10-24 11:21:26,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413135075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:26,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:26,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:21:26,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303079307] [2024-10-24 11:21:26,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:26,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:21:26,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:26,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:21:26,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:21:26,446 INFO L87 Difference]: Start difference. First operand 154 states and 230 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (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-10-24 11:21:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:26,542 INFO L93 Difference]: Finished difference Result 427 states and 638 transitions. [2024-10-24 11:21:26,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:21:26,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (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 180 [2024-10-24 11:21:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:26,545 INFO L225 Difference]: With dead ends: 427 [2024-10-24 11:21:26,545 INFO L226 Difference]: Without dead ends: 274 [2024-10-24 11:21:26,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:21:26,547 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 164 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:26,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 987 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-24 11:21:26,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2024-10-24 11:21:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 234 states have (on average 1.4444444444444444) internal successors, (338), 235 states have internal predecessors, (338), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:21:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 406 transitions. [2024-10-24 11:21:26,569 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 406 transitions. Word has length 180 [2024-10-24 11:21:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:26,569 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 406 transitions. [2024-10-24 11:21:26,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (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-10-24 11:21:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 406 transitions. [2024-10-24 11:21:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-24 11:21:26,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:26,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] [2024-10-24 11:21:26,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:21:26,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:26,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:26,572 INFO L85 PathProgramCache]: Analyzing trace with hash -327072258, now seen corresponding path program 1 times [2024-10-24 11:21:26,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:26,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664612085] [2024-10-24 11:21:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:26,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:21:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:21:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:21:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:21:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:21:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:21:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:21:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:21:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:21:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:21:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:21:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:21:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:21:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:21:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:21:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:21:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:21:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:21:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:21:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 11:21:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 11:21:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 11:21:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 11:21:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664612085] [2024-10-24 11:21:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664612085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:27,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:27,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:21:27,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270560405] [2024-10-24 11:21:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:27,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:27,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:27,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:27,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:27,142 INFO L87 Difference]: Start difference. First operand 271 states and 406 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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-10-24 11:21:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:27,228 INFO L93 Difference]: Finished difference Result 547 states and 815 transitions. [2024-10-24 11:21:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:21:27,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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 182 [2024-10-24 11:21:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:27,233 INFO L225 Difference]: With dead ends: 547 [2024-10-24 11:21:27,233 INFO L226 Difference]: Without dead ends: 277 [2024-10-24 11:21:27,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 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-10-24 11:21:27,235 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 122 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:27,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1076 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-24 11:21:27,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2024-10-24 11:21:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 237 states have (on average 1.4345991561181435) internal successors, (340), 238 states have internal predecessors, (340), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:21:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 408 transitions. [2024-10-24 11:21:27,254 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 408 transitions. Word has length 182 [2024-10-24 11:21:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:27,255 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 408 transitions. [2024-10-24 11:21:27,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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-10-24 11:21:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 408 transitions. [2024-10-24 11:21:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-24 11:21:27,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:27,257 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] [2024-10-24 11:21:27,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:21:27,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:27,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1261275644, now seen corresponding path program 1 times [2024-10-24 11:21:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:27,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451752394] [2024-10-24 11:21:27,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:27,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:21:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:21:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:21:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:21:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:21:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:21:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:21:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:21:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:21:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:21:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:21:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:21:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:21:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:21:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:21:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:21:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:21:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:21:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:21:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 11:21:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 11:21:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 11:21:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-24 11:21:28,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:28,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451752394] [2024-10-24 11:21:28,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451752394] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:21:28,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651320341] [2024-10-24 11:21:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:28,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:21:28,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:21:28,235 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-10-24 11:21:28,237 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-10-24 11:21:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 11:21:28,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:28,529 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 9 treesize of output 3 [2024-10-24 11:21:28,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-24 11:21:28,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-24 11:21:28,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-10-24 11:21:28,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:21:28,717 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-10-24 11:21:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 442 proven. 15 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2024-10-24 11:21:28,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:21:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-24 11:21:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651320341] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:21:28,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:21:28,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2024-10-24 11:21:28,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959863383] [2024-10-24 11:21:28,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:21:28,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:21:28,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:28,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:21:28,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:21:28,947 INFO L87 Difference]: Start difference. First operand 275 states and 408 transitions. Second operand has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 15 states have internal predecessors, (87), 5 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 3 states have call predecessors, (34), 5 states have call successors, (34) [2024-10-24 11:21:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:30,078 INFO L93 Difference]: Finished difference Result 652 states and 952 transitions. [2024-10-24 11:21:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-24 11:21:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 15 states have internal predecessors, (87), 5 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 3 states have call predecessors, (34), 5 states have call successors, (34) Word has length 182 [2024-10-24 11:21:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:30,081 INFO L225 Difference]: With dead ends: 652 [2024-10-24 11:21:30,081 INFO L226 Difference]: Without dead ends: 378 [2024-10-24 11:21:30,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=953, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 11:21:30,083 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 973 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:30,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 903 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:21:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-24 11:21:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 358. [2024-10-24 11:21:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 291 states have (on average 1.3780068728522337) internal successors, (401), 293 states have internal predecessors, (401), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-24 11:21:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 519 transitions. [2024-10-24 11:21:30,109 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 519 transitions. Word has length 182 [2024-10-24 11:21:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:30,109 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 519 transitions. [2024-10-24 11:21:30,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 15 states have internal predecessors, (87), 5 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 3 states have call predecessors, (34), 5 states have call successors, (34) [2024-10-24 11:21:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 519 transitions. [2024-10-24 11:21:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 11:21:30,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:30,112 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] [2024-10-24 11:21:30,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:21:30,312 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,SelfDestructingSolverStorable5 [2024-10-24 11:21:30,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:30,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:30,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1874276182, now seen corresponding path program 1 times [2024-10-24 11:21:30,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:30,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332139447] [2024-10-24 11:21:30,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:30,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:21:30,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:21:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:21:30,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:21:30,517 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:21:30,518 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:21:30,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:21:30,523 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:30,621 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:21:30,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:21:30 BoogieIcfgContainer [2024-10-24 11:21:30,624 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:21:30,624 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:21:30,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:21:30,625 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:21:30,625 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:21:24" (3/4) ... [2024-10-24 11:21:30,627 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:21:30,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:21:30,628 INFO L158 Benchmark]: Toolchain (without parser) took 7164.67ms. Allocated memory was 130.0MB in the beginning and 293.6MB in the end (delta: 163.6MB). Free memory was 61.4MB in the beginning and 107.6MB in the end (delta: -46.3MB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. [2024-10-24 11:21:30,628 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 99.0MB in the beginning and 98.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:21:30,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.96ms. Allocated memory was 130.0MB in the beginning and 190.8MB in the end (delta: 60.8MB). Free memory was 61.2MB in the beginning and 145.5MB in the end (delta: -84.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-10-24 11:21:30,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.78ms. Allocated memory is still 190.8MB. Free memory was 145.5MB in the beginning and 139.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:21:30,629 INFO L158 Benchmark]: Boogie Preprocessor took 105.43ms. Allocated memory is still 190.8MB. Free memory was 139.2MB in the beginning and 131.7MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 11:21:30,629 INFO L158 Benchmark]: RCFGBuilder took 759.70ms. Allocated memory is still 190.8MB. Free memory was 131.7MB in the beginning and 141.3MB in the end (delta: -9.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-24 11:21:30,630 INFO L158 Benchmark]: TraceAbstraction took 5892.47ms. Allocated memory was 190.8MB in the beginning and 293.6MB in the end (delta: 102.8MB). Free memory was 140.2MB in the beginning and 108.7MB in the end (delta: 31.5MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. [2024-10-24 11:21:30,630 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 293.6MB. Free memory was 108.7MB in the beginning and 107.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:21:30,631 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 99.0MB in the beginning and 98.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.96ms. Allocated memory was 130.0MB in the beginning and 190.8MB in the end (delta: 60.8MB). Free memory was 61.2MB in the beginning and 145.5MB in the end (delta: -84.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.78ms. Allocated memory is still 190.8MB. Free memory was 145.5MB in the beginning and 139.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.43ms. Allocated memory is still 190.8MB. Free memory was 139.2MB in the beginning and 131.7MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 759.70ms. Allocated memory is still 190.8MB. Free memory was 131.7MB in the beginning and 141.3MB in the end (delta: -9.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5892.47ms. Allocated memory was 190.8MB in the beginning and 293.6MB in the end (delta: 102.8MB). Free memory was 140.2MB in the beginning and 108.7MB in the end (delta: 31.5MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 293.6MB. Free memory was 108.7MB in the beginning and 107.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of shiftLeft at line 53, overapproximation of someBinaryArithmeticFLOAToperation at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[1] = { 64 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[1] = { 64 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L61] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L62] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L62] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L62] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] float_Array_0[0][0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[0][0] [L68] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F [L68] EXPR float_Array_0[0][0] [L68] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not((float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not((float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] float_Array_0[1][0] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[1][0] [L70] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F [L70] EXPR float_Array_0[1][0] [L70] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] float_Array_0[0][1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0][1] [L72] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L72] EXPR float_Array_0[0][1] [L72] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L74] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 8191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L80] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_short_int_Array_0[2] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 8192) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 8192) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L83] EXPR signed_short_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(signed_short_int_Array_0[3] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR signed_short_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] unsigned_short_int_Array_0[0][0] = __VERIFIER_nondet_ushort() [L86] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L89] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L95] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] unsigned_short_int_Array_0[1][2] = __VERIFIER_nondet_ushort() [L98] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L112] RET updateVariables() [L113] CALL step() [L40] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] COND FALSE !(! BOOL_unsigned_char_Array_0[1]) [L43] EXPR signed_short_int_Array_0[1] [L43] signed_short_int_Array_0[4] = signed_short_int_Array_0[1] [L45] EXPR signed_short_int_Array_0[1] [L45] signed short int stepLocal_0 = signed_short_int_Array_0[1]; [L46] COND TRUE stepLocal_0 > 2 [L47] EXPR float_Array_0[1][0] [L47] EXPR float_Array_0[0][0] [L47] EXPR float_Array_0[0][1] [L47] float_Array_0[1][1] = ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]) [L49] EXPR unsigned_short_int_Array_0[1][1] [L49] unsigned_long_int_Array_0[0] = unsigned_short_int_Array_0[1][1] [L50] EXPR BOOL_unsigned_char_Array_0[1] [L50] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] [L50] EXPR BOOL_unsigned_char_Array_0[0] [L50] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] COND FALSE !(BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) [L53] EXPR signed_short_int_Array_0[3] [L53] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] EXPR -25 << unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] COND FALSE !(signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) [L56] EXPR unsigned_short_int_Array_0[1][1] [L56] EXPR unsigned_short_int_Array_0[1][2] [L56] unsigned_short_int_Array_0[1][0] = (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2]) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) [L104] EXPR signed_short_int_Array_0[4] [L104] EXPR signed_short_int_Array_0[1] [L104] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1) [L104] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1 [L104] EXPR float_Array_0[1][1] [L104] EXPR float_Array_0[1][0] [L104] EXPR float_Array_0[0][0] [L104] EXPR float_Array_0[0][1] [L104] EXPR (signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2])))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_short_int_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2])))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_short_int_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104-L105] return ((((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2])))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_short_int_Array_0[1][1])) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 152 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1261 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1260 mSDsluCounter, 4494 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3157 mSDsCounter, 278 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1251 IncrementalHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 278 mSolverCounterUnsat, 1337 mSDtfsCounter, 1251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 746 GetRequests, 697 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=6, InterpolantAutomatonStates: 46, 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, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1449 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1440 ConstructedInterpolants, 0 QuantifiedInterpolants, 2641 SizeOfPredicates, 8 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 9555/9600 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-10-24 11:21:30,663 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.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 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:21:32,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:21:32,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:21:32,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:21:32,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:21:32,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:21:32,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:21:32,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:21:32,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:21:32,564 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:21:32,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:21:32,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:21:32,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:21:32,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:21:32,568 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:21:32,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:21:32,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:21:32,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:21:32,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:21:32,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:21:32,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:21:32,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:21:32,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:21:32,569 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:21:32,569 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:21:32,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:21:32,570 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:21:32,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:21:32,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:21:32,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:21:32,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:21:32,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:21:32,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:21:32,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:21:32,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:21:32,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:21:32,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:21:32,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:21:32,573 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:21:32,573 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:21:32,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:21:32,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:21:32,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:21:32,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:21:32,574 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:21:32,574 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 -> 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 [2024-10-24 11:21:32,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:21:32,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:21:32,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:21:32,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:21:32,850 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:21:32,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2024-10-24 11:21:34,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:21:34,277 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:21:34,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2024-10-24 11:21:34,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52610a43/45b8dbffbeed46ea99ca1f6aa0b32b02/FLAGf856dc120 [2024-10-24 11:21:34,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52610a43/45b8dbffbeed46ea99ca1f6aa0b32b02 [2024-10-24 11:21:34,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:21:34,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:21:34,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:21:34,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:21:34,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:21:34,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c32ef56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34, skipping insertion in model container [2024-10-24 11:21:34,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:21:34,490 WARN L248 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-86.i[916,929] [2024-10-24 11:21:34,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:21:34,601 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:21:34,610 WARN L248 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-86.i[916,929] [2024-10-24 11:21:34,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:21:34,704 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:21:34,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34 WrapperNode [2024-10-24 11:21:34,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:21:34,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:21:34,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:21:34,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:21:34,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,765 INFO L138 Inliner]: procedures = 36, calls = 247, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 752 [2024-10-24 11:21:34,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:21:34,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:21:34,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:21:34,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:21:34,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,811 INFO L175 MemorySlicer]: Split 206 memory accesses to 6 slices as follows [2, 14, 27, 43, 5, 115]. 56 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 5, 1, 6]. The 21 writes are split as follows [0, 2, 4, 6, 1, 8]. [2024-10-24 11:21:34,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:21:34,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:21:34,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:21:34,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:21:34,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (1/1) ... [2024-10-24 11:21:34,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:21:34,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:21:34,907 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-10-24 11:21:34,912 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-10-24 11:21:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:21:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:21:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:21:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:21:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:21:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:21:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:21:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:21:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 11:21:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 11:21:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-24 11:21:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-24 11:21:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:21:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:21:34,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:21:34,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:21:34,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:21:34,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:21:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:21:34,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:21:34,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:21:34,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:21:34,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-24 11:21:34,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-24 11:21:34,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:21:34,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:21:34,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 11:21:34,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 11:21:34,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-24 11:21:34,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-24 11:21:35,105 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:21:35,107 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:21:35,982 INFO L? ?]: Removed 247 outVars from TransFormulas that were not future-live. [2024-10-24 11:21:35,983 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:21:36,025 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:21:36,026 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:21:36,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:21:36 BoogieIcfgContainer [2024-10-24 11:21:36,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:21:36,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:21:36,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:21:36,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:21:36,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:21:34" (1/3) ... [2024-10-24 11:21:36,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1015f15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:21:36, skipping insertion in model container [2024-10-24 11:21:36,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:34" (2/3) ... [2024-10-24 11:21:36,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1015f15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:21:36, skipping insertion in model container [2024-10-24 11:21:36,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:21:36" (3/3) ... [2024-10-24 11:21:36,034 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-86.i [2024-10-24 11:21:36,047 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:21:36,047 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:21:36,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:21:36,105 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;@492407a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:21:36,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:21:36,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 121 states have internal predecessors, (175), 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-10-24 11:21:36,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 11:21:36,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:36,128 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] [2024-10-24 11:21:36,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:36,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:36,133 INFO L85 PathProgramCache]: Analyzing trace with hash -824726874, now seen corresponding path program 1 times [2024-10-24 11:21:36,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:36,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583290530] [2024-10-24 11:21:36,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:36,146 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-10-24 11:21:36,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:36,149 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-10-24 11:21:36,150 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-10-24 11:21:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:36,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:21:36,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2024-10-24 11:21:36,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:36,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:36,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583290530] [2024-10-24 11:21:36,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583290530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:36,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:36,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:21:36,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950483342] [2024-10-24 11:21:36,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:36,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:21:36,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:36,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:21:36,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:21:36,611 INFO L87 Difference]: Start difference. First operand has 148 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 121 states have internal predecessors, (175), 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 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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-10-24 11:21:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:36,658 INFO L93 Difference]: Finished difference Result 293 states and 473 transitions. [2024-10-24 11:21:36,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:21:36,662 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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 179 [2024-10-24 11:21:36,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:36,671 INFO L225 Difference]: With dead ends: 293 [2024-10-24 11:21:36,672 INFO L226 Difference]: Without dead ends: 146 [2024-10-24 11:21:36,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 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-10-24 11:21:36,681 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 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-10-24 11:21:36,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:36,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-24 11:21:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-10-24 11:21:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 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-10-24 11:21:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2024-10-24 11:21:36,738 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 179 [2024-10-24 11:21:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:36,738 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2024-10-24 11:21:36,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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-10-24 11:21:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-10-24 11:21:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 11:21:36,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:36,744 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] [2024-10-24 11:21:36,758 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-10-24 11:21:36,945 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-10-24 11:21:36,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:36,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:36,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1675213816, now seen corresponding path program 1 times [2024-10-24 11:21:36,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:36,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994495278] [2024-10-24 11:21:36,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:36,947 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-10-24 11:21:36,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:36,964 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-10-24 11:21:36,965 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-10-24 11:21:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:37,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:21:37,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-10-24 11:21:37,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:37,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:37,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994495278] [2024-10-24 11:21:37,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994495278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:37,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:37,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:37,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937705417] [2024-10-24 11:21:37,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:37,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:21:37,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:37,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:21:37,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:37,355 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-10-24 11:21:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:37,428 INFO L93 Difference]: Finished difference Result 293 states and 442 transitions. [2024-10-24 11:21:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:37,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 179 [2024-10-24 11:21:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:37,430 INFO L225 Difference]: With dead ends: 293 [2024-10-24 11:21:37,430 INFO L226 Difference]: Without dead ends: 148 [2024-10-24 11:21:37,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 176 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-10-24 11:21:37,431 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:37,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-24 11:21:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-10-24 11:21:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 121 states have (on average 1.421487603305785) internal successors, (172), 121 states have internal predecessors, (172), 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-10-24 11:21:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2024-10-24 11:21:37,448 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 179 [2024-10-24 11:21:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:37,449 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2024-10-24 11:21:37,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-10-24 11:21:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2024-10-24 11:21:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 11:21:37,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:37,454 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] [2024-10-24 11:21:37,468 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-10-24 11:21:37,655 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-10-24 11:21:37,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:37,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:37,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1220799878, now seen corresponding path program 1 times [2024-10-24 11:21:37,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:37,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033392586] [2024-10-24 11:21:37,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:37,657 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-10-24 11:21:37,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:37,659 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-10-24 11:21:37,660 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-10-24 11:21:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:37,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:21:37,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-10-24 11:21:38,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:21:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 11:21:38,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:38,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033392586] [2024-10-24 11:21:38,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033392586] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:21:38,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:21:38,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-10-24 11:21:38,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686721597] [2024-10-24 11:21:38,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:38,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:21:38,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:38,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:21:38,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:21:38,555 INFO L87 Difference]: Start difference. First operand 148 states and 222 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (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-10-24 11:21:38,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:38,649 INFO L93 Difference]: Finished difference Result 376 states and 564 transitions. [2024-10-24 11:21:38,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:21:38,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (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 179 [2024-10-24 11:21:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:38,653 INFO L225 Difference]: With dead ends: 376 [2024-10-24 11:21:38,653 INFO L226 Difference]: Without dead ends: 229 [2024-10-24 11:21:38,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:21:38,654 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 228 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:38,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 635 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-24 11:21:38,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2024-10-24 11:21:38,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 196 states have (on average 1.4591836734693877) internal successors, (286), 197 states have internal predecessors, (286), 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-10-24 11:21:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 340 transitions. [2024-10-24 11:21:38,673 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 340 transitions. Word has length 179 [2024-10-24 11:21:38,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:38,673 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 340 transitions. [2024-10-24 11:21:38,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (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-10-24 11:21:38,674 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 340 transitions. [2024-10-24 11:21:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 11:21:38,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:38,675 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] [2024-10-24 11:21:38,686 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-10-24 11:21:38,879 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-10-24 11:21:38,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:38,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:38,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2063050168, now seen corresponding path program 1 times [2024-10-24 11:21:38,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:38,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246213124] [2024-10-24 11:21:38,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:38,881 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-10-24 11:21:38,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:38,884 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-10-24 11:21:38,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:21:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:39,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:21:39,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 11:21:39,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:39,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:39,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246213124] [2024-10-24 11:21:39,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246213124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:39,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:39,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:21:39,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454087213] [2024-10-24 11:21:39,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:39,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:21:39,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:39,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:21:39,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:21:39,210 INFO L87 Difference]: Start difference. First operand 226 states and 340 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (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-10-24 11:21:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:39,263 INFO L93 Difference]: Finished difference Result 461 states and 693 transitions. [2024-10-24 11:21:39,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:21:39,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (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 179 [2024-10-24 11:21:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:39,267 INFO L225 Difference]: With dead ends: 461 [2024-10-24 11:21:39,267 INFO L226 Difference]: Without dead ends: 236 [2024-10-24 11:21:39,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 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-10-24 11:21:39,270 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:39,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 838 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-24 11:21:39,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2024-10-24 11:21:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.4411764705882353) internal successors, (294), 205 states have internal predecessors, (294), 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-10-24 11:21:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 348 transitions. [2024-10-24 11:21:39,288 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 348 transitions. Word has length 179 [2024-10-24 11:21:39,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:39,289 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 348 transitions. [2024-10-24 11:21:39,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (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-10-24 11:21:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 348 transitions. [2024-10-24 11:21:39,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 11:21:39,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:39,291 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] [2024-10-24 11:21:39,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 11:21:39,492 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-10-24 11:21:39,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:39,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:39,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2062990586, now seen corresponding path program 1 times [2024-10-24 11:21:39,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:39,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459508666] [2024-10-24 11:21:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:39,493 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-10-24 11:21:39,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:39,496 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-10-24 11:21:39,497 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-10-24 11:21:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:39,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:21:39,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:39,876 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 77 treesize of output 41 [2024-10-24 11:21:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-10-24 11:21:39,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:39,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:39,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459508666] [2024-10-24 11:21:39,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459508666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:39,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:39,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:21:39,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705803287] [2024-10-24 11:21:39,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:39,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:39,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:39,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:39,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:39,916 INFO L87 Difference]: Start difference. First operand 234 states and 348 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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-10-24 11:21:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:40,438 INFO L93 Difference]: Finished difference Result 468 states and 696 transitions. [2024-10-24 11:21:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:21:40,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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 179 [2024-10-24 11:21:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:40,441 INFO L225 Difference]: With dead ends: 468 [2024-10-24 11:21:40,441 INFO L226 Difference]: Without dead ends: 235 [2024-10-24 11:21:40,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:21:40,442 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 203 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:40,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 751 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:21:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-24 11:21:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2024-10-24 11:21:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.4362745098039216) internal successors, (293), 205 states have internal predecessors, (293), 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-10-24 11:21:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 347 transitions. [2024-10-24 11:21:40,451 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 347 transitions. Word has length 179 [2024-10-24 11:21:40,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:40,451 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 347 transitions. [2024-10-24 11:21:40,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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-10-24 11:21:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 347 transitions. [2024-10-24 11:21:40,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-24 11:21:40,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:40,453 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] [2024-10-24 11:21:40,462 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-10-24 11:21:40,653 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-10-24 11:21:40,653 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:40,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash 723587530, now seen corresponding path program 1 times [2024-10-24 11:21:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:40,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806383119] [2024-10-24 11:21:40,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:40,655 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-10-24 11:21:40,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:40,656 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-10-24 11:21:40,656 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-10-24 11:21:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:40,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:21:40,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2024-10-24 11:21:40,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:40,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:40,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806383119] [2024-10-24 11:21:40,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806383119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:40,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:40,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:21:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061877086] [2024-10-24 11:21:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:40,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:40,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:40,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:40,956 INFO L87 Difference]: Start difference. First operand 234 states and 347 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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-10-24 11:21:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:41,135 INFO L93 Difference]: Finished difference Result 473 states and 700 transitions. [2024-10-24 11:21:41,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:21:41,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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 181 [2024-10-24 11:21:41,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:41,138 INFO L225 Difference]: With dead ends: 473 [2024-10-24 11:21:41,138 INFO L226 Difference]: Without dead ends: 238 [2024-10-24 11:21:41,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 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-10-24 11:21:41,139 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:41,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 877 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:21:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-24 11:21:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-10-24 11:21:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.4313725490196079) internal successors, (292), 205 states have internal predecessors, (292), 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-10-24 11:21:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 346 transitions. [2024-10-24 11:21:41,152 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 346 transitions. Word has length 181 [2024-10-24 11:21:41,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:41,152 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 346 transitions. [2024-10-24 11:21:41,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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-10-24 11:21:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 346 transitions. [2024-10-24 11:21:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-24 11:21:41,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:41,153 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] [2024-10-24 11:21:41,168 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-10-24 11:21:41,360 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-10-24 11:21:41,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:41,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:41,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1170746356, now seen corresponding path program 1 times [2024-10-24 11:21:41,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:41,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444716618] [2024-10-24 11:21:41,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:41,362 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-10-24 11:21:41,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:41,363 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-10-24 11:21:41,364 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-10-24 11:21:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:41,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:21:41,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:41,738 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 95 treesize of output 41 [2024-10-24 11:21:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-10-24 11:21:41,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:41,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:41,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444716618] [2024-10-24 11:21:41,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444716618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:41,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:41,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:21:41,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667891652] [2024-10-24 11:21:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:41,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:41,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:41,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:41,758 INFO L87 Difference]: Start difference. First operand 234 states and 346 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 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-10-24 11:21:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:42,226 INFO L93 Difference]: Finished difference Result 468 states and 692 transitions. [2024-10-24 11:21:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:21:42,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 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 181 [2024-10-24 11:21:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:42,228 INFO L225 Difference]: With dead ends: 468 [2024-10-24 11:21:42,228 INFO L226 Difference]: Without dead ends: 235 [2024-10-24 11:21:42,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:21:42,229 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 193 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:42,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 743 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:21:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-24 11:21:42,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2024-10-24 11:21:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.4264705882352942) internal successors, (291), 205 states have internal predecessors, (291), 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-10-24 11:21:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 345 transitions. [2024-10-24 11:21:42,239 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 345 transitions. Word has length 181 [2024-10-24 11:21:42,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:42,239 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 345 transitions. [2024-10-24 11:21:42,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 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-10-24 11:21:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 345 transitions. [2024-10-24 11:21:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 11:21:42,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:42,241 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] [2024-10-24 11:21:42,252 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-10-24 11:21:42,442 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-10-24 11:21:42,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:42,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:42,443 INFO L85 PathProgramCache]: Analyzing trace with hash 947521862, now seen corresponding path program 1 times [2024-10-24 11:21:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:42,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908448422] [2024-10-24 11:21:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:42,443 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-10-24 11:21:42,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:42,446 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-10-24 11:21:42,446 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-10-24 11:21:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:42,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:21:42,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:42,837 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 95 treesize of output 41 [2024-10-24 11:21:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-10-24 11:21:42,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:42,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:42,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908448422] [2024-10-24 11:21:42,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908448422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:42,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:42,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:21:42,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608512818] [2024-10-24 11:21:42,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:42,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:42,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:42,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:42,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:42,855 INFO L87 Difference]: Start difference. First operand 234 states and 345 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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-10-24 11:21:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:43,359 INFO L93 Difference]: Finished difference Result 467 states and 689 transitions. [2024-10-24 11:21:43,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:21:43,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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 183 [2024-10-24 11:21:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:43,360 INFO L225 Difference]: With dead ends: 467 [2024-10-24 11:21:43,360 INFO L226 Difference]: Without dead ends: 234 [2024-10-24 11:21:43,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:21:43,361 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 185 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:43,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 738 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:21:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-24 11:21:43,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2024-10-24 11:21:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 202 states have (on average 1.4257425742574257) internal successors, (288), 203 states have internal predecessors, (288), 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-10-24 11:21:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions. [2024-10-24 11:21:43,368 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 183 [2024-10-24 11:21:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:43,368 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions. [2024-10-24 11:21:43,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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-10-24 11:21:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions. [2024-10-24 11:21:43,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 11:21:43,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:43,369 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] [2024-10-24 11:21:43,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 11:21:43,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:21:43,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:43,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:43,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1249569358, now seen corresponding path program 1 times [2024-10-24 11:21:43,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:43,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436839180] [2024-10-24 11:21:43,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:43,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:21:43,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:43,573 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:21:43,573 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-10-24 11:21:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:43,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:21:43,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:43,989 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 94 treesize of output 40 [2024-10-24 11:21:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 504 proven. 24 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-10-24 11:21:44,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:21:44,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-10-24 11:21:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-24 11:21:44,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:44,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436839180] [2024-10-24 11:21:44,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436839180] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:21:44,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:21:44,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-24 11:21:44,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117972749] [2024-10-24 11:21:44,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:21:44,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:21:44,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:44,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:21:44,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:21:44,229 INFO L87 Difference]: Start difference. First operand 232 states and 342 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2024-10-24 11:21:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:45,062 INFO L93 Difference]: Finished difference Result 478 states and 700 transitions. [2024-10-24 11:21:45,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:21:45,063 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) Word has length 185 [2024-10-24 11:21:45,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:45,064 INFO L225 Difference]: With dead ends: 478 [2024-10-24 11:21:45,064 INFO L226 Difference]: Without dead ends: 236 [2024-10-24 11:21:45,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:21:45,065 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 180 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:45,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 954 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:21:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-24 11:21:45,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2024-10-24 11:21:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 202 states have (on average 1.4158415841584158) internal successors, (286), 203 states have internal predecessors, (286), 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-10-24 11:21:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 340 transitions. [2024-10-24 11:21:45,071 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 340 transitions. Word has length 185 [2024-10-24 11:21:45,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:45,074 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 340 transitions. [2024-10-24 11:21:45,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2024-10-24 11:21:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 340 transitions. [2024-10-24 11:21:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 11:21:45,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:45,076 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] [2024-10-24 11:21:45,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-24 11:21:45,276 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-10-24 11:21:45,276 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:45,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1179921484, now seen corresponding path program 1 times [2024-10-24 11:21:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:45,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842399287] [2024-10-24 11:21:45,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:45,277 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-10-24 11:21:45,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:45,279 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-10-24 11:21:45,280 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-10-24 11:21:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:45,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 11:21:45,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:45,777 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-10-24 11:21:45,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-10-24 11:21:45,979 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 36 treesize of output 29 [2024-10-24 11:21:46,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:46,590 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 53 treesize of output 43 [2024-10-24 11:21:46,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:46,826 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 108 treesize of output 48 [2024-10-24 11:21:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 745 proven. 42 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2024-10-24 11:21:46,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:21:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 11:21:47,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:47,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842399287] [2024-10-24 11:21:47,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842399287] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:21:47,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:21:47,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 17 [2024-10-24 11:21:47,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378292427] [2024-10-24 11:21:47,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:47,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:21:47,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:47,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:21:47,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:21:47,057 INFO L87 Difference]: Start difference. First operand 232 states and 340 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-10-24 11:21:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:47,525 INFO L93 Difference]: Finished difference Result 539 states and 775 transitions. [2024-10-24 11:21:47,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:21:47,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 185 [2024-10-24 11:21:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:47,528 INFO L225 Difference]: With dead ends: 539 [2024-10-24 11:21:47,528 INFO L226 Difference]: Without dead ends: 308 [2024-10-24 11:21:47,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:21:47,529 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 200 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:47,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1251 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:21:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-24 11:21:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2024-10-24 11:21:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 256 states have (on average 1.3515625) internal successors, (346), 258 states have internal predecessors, (346), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 11:21:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 432 transitions. [2024-10-24 11:21:47,538 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 432 transitions. Word has length 185 [2024-10-24 11:21:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:47,539 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 432 transitions. [2024-10-24 11:21:47,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-10-24 11:21:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 432 transitions. [2024-10-24 11:21:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 11:21:47,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:47,540 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] [2024-10-24 11:21:47,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-24 11:21:47,740 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-10-24 11:21:47,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:47,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:47,741 INFO L85 PathProgramCache]: Analyzing trace with hash 409332561, now seen corresponding path program 1 times [2024-10-24 11:21:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:47,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348976375] [2024-10-24 11:21:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:47,742 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-10-24 11:21:47,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:47,744 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-10-24 11:21:47,745 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