./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-p_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:35:54,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:35:55,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:35:55,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:35:55,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:35:55,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:35:55,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:35:55,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:35:55,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:35:55,055 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:35:55,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:35:55,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:35:55,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:35:55,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:35:55,059 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:35:55,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:35:55,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:35:55,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:35:55,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:35:55,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:35:55,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:35:55,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:35:55,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:35:55,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:35:55,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:35:55,067 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:35:55,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:35:55,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:35:55,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:35:55,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:35:55,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:35:55,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:35:55,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:35:55,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:35:55,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:35:55,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:35:55,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:35:55,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:35:55,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:35:55,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:35:55,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:35:55,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:35:55,072 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-clean/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-clean/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 -> e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf [2024-10-11 13:35:55,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:35:55,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:35:55,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:35:55,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:35:55,398 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:35:55,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2024-10-11 13:35:56,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:35:57,077 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:35:57,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2024-10-11 13:35:57,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/250b673b5/d11ff5e9d1a748a2b6c34a6f049725d4/FLAG87e10268f [2024-10-11 13:35:57,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/250b673b5/d11ff5e9d1a748a2b6c34a6f049725d4 [2024-10-11 13:35:57,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:35:57,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:35:57,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:35:57,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:35:57,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:35:57,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0e9e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57, skipping insertion in model container [2024-10-11 13:35:57,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:35:57,621 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-p_file-22.i[916,929] [2024-10-11 13:35:57,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:35:57,698 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:35:57,711 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-p_file-22.i[916,929] [2024-10-11 13:35:57,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:35:57,765 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:35:57,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57 WrapperNode [2024-10-11 13:35:57,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:35:57,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:35:57,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:35:57,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:35:57,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,820 INFO L138 Inliner]: procedures = 29, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2024-10-11 13:35:57,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:35:57,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:35:57,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:35:57,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:35:57,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,862 INFO L175 MemorySlicer]: Split 96 memory accesses to 11 slices as follows [2, 8, 8, 17, 16, 3, 8, 10, 8, 8, 8]. 18 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 2, 1, 2, 1, 1, 1, 1, 1, 3, 1]. [2024-10-11 13:35:57,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:35:57,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:35:57,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:35:57,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:35:57,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (1/1) ... [2024-10-11 13:35:57,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:35:57,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:35:57,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:35:57,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:35:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:35:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:35:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:35:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:35:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:35:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:35:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:35:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:35:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:35:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:35:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:35:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-11 13:35:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:35:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:35:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:35:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:35:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:35:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:35:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:35:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:35:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:35:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:35:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:35:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:35:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:35:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:35:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:35:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:35:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:35:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:35:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:35:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:35:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:35:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-11 13:35:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:35:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:35:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:35:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:35:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:35:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:35:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:35:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:35:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:35:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:35:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:35:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:35:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:35:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:35:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:35:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:35:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:35:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:35:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:35:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:35:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:35:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:35:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:35:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:35:58,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:35:58,189 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:35:58,191 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:35:58,692 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-11 13:35:58,693 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:35:58,731 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:35:58,731 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:35:58,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:35:58 BoogieIcfgContainer [2024-10-11 13:35:58,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:35:58,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:35:58,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:35:58,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:35:58,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:35:57" (1/3) ... [2024-10-11 13:35:58,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3616a888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:35:58, skipping insertion in model container [2024-10-11 13:35:58,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:57" (2/3) ... [2024-10-11 13:35:58,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3616a888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:35:58, skipping insertion in model container [2024-10-11 13:35:58,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:35:58" (3/3) ... [2024-10-11 13:35:58,742 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-22.i [2024-10-11 13:35:58,760 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:35:58,781 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:35:58,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:35:58,876 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;@4112b5e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:35:58,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:35:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:35:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:35:58,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:58,896 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:58,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:58,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1363114807, now seen corresponding path program 1 times [2024-10-11 13:35:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:58,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849899608] [2024-10-11 13:35:58,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:58,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:35:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:35:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:35:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:35:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:35:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:35:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:35:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:35:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:35:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:35:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:35:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:35:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849899608] [2024-10-11 13:35:59,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849899608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:59,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:59,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:35:59,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956110711] [2024-10-11 13:35:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:59,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:35:59,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:35:59,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:35:59,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:35:59,394 INFO L87 Difference]: Start difference. First operand has 98 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 13:35:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:59,445 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2024-10-11 13:35:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:35:59,447 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2024-10-11 13:35:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:59,456 INFO L225 Difference]: With dead ends: 193 [2024-10-11 13:35:59,457 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 13:35:59,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-11 13:35:59,466 INFO L432 NwaCegarLoop]: 137 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, 137 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-11 13:35:59,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:35:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 13:35:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 13:35:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:35:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-10-11 13:35:59,505 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 85 [2024-10-11 13:35:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:59,505 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-10-11 13:35:59,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 13:35:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-10-11 13:35:59,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:35:59,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:59,510 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:59,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:35:59,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:59,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash -333113909, now seen corresponding path program 1 times [2024-10-11 13:35:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835832112] [2024-10-11 13:35:59,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:59,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:35:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:35:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:35:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:35:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:35:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:35:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:35:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:35:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:35:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:35:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:35:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:35:59,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835832112] [2024-10-11 13:35:59,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835832112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:59,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:59,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:35:59,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447253932] [2024-10-11 13:35:59,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:59,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:35:59,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:35:59,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:35:59,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:35:59,856 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 13:35:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:59,912 INFO L93 Difference]: Finished difference Result 193 states and 284 transitions. [2024-10-11 13:35:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:35:59,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2024-10-11 13:35:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:59,916 INFO L225 Difference]: With dead ends: 193 [2024-10-11 13:35:59,916 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 13:35:59,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-11 13:35:59,918 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 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-11 13:35:59,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:35:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 13:35:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 13:35:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:35:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2024-10-11 13:35:59,929 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 85 [2024-10-11 13:35:59,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:59,931 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2024-10-11 13:35:59,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 13:35:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2024-10-11 13:35:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:35:59,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:59,937 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:59,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:35:59,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:59,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash -756760631, now seen corresponding path program 1 times [2024-10-11 13:35:59,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:59,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024150581] [2024-10-11 13:35:59,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:59,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:00,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:00,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:00,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:00,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:00,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:00,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:00,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:00,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:00,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:00,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:00,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024150581] [2024-10-11 13:36:00,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024150581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:00,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:00,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:36:00,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100580359] [2024-10-11 13:36:00,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:00,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:36:00,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:00,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:36:00,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:36:00,767 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:01,740 INFO L93 Difference]: Finished difference Result 491 states and 717 transitions. [2024-10-11 13:36:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:36:01,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 85 [2024-10-11 13:36:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:01,745 INFO L225 Difference]: With dead ends: 491 [2024-10-11 13:36:01,745 INFO L226 Difference]: Without dead ends: 394 [2024-10-11 13:36:01,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:36:01,747 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 353 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:01,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 965 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:36:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-11 13:36:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 277. [2024-10-11 13:36:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 246 states have (on average 1.4268292682926829) internal successors, (351), 246 states have internal predecessors, (351), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 405 transitions. [2024-10-11 13:36:01,786 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 405 transitions. Word has length 85 [2024-10-11 13:36:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:01,787 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 405 transitions. [2024-10-11 13:36:01,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 405 transitions. [2024-10-11 13:36:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 13:36:01,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:01,789 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:01,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:36:01,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:01,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:01,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1416680787, now seen corresponding path program 1 times [2024-10-11 13:36:01,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:01,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632297744] [2024-10-11 13:36:01,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:01,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:01,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:01,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:01,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:01,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:01,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:01,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:01,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:01,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:01,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:01,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:01,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632297744] [2024-10-11 13:36:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632297744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:01,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:01,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:36:01,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054837140] [2024-10-11 13:36:01,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:01,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:36:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:01,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:36:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:36:01,934 INFO L87 Difference]: Start difference. First operand 277 states and 405 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:01,965 INFO L93 Difference]: Finished difference Result 571 states and 837 transitions. [2024-10-11 13:36:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:36:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-10-11 13:36:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:01,969 INFO L225 Difference]: With dead ends: 571 [2024-10-11 13:36:01,969 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 13:36:01,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:36:01,974 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 28 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:01,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 267 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 13:36:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 196. [2024-10-11 13:36:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 175 states have (on average 1.417142857142857) internal successors, (248), 175 states have internal predecessors, (248), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:36:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 284 transitions. [2024-10-11 13:36:02,004 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 284 transitions. Word has length 86 [2024-10-11 13:36:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:02,005 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 284 transitions. [2024-10-11 13:36:02,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 284 transitions. [2024-10-11 13:36:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 13:36:02,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:02,009 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:02,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:36:02,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:02,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:02,010 INFO L85 PathProgramCache]: Analyzing trace with hash -126327642, now seen corresponding path program 1 times [2024-10-11 13:36:02,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:02,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491396884] [2024-10-11 13:36:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:02,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:02,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:02,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:02,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:02,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:02,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:02,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:02,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491396884] [2024-10-11 13:36:02,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491396884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:02,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:02,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:36:02,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444953782] [2024-10-11 13:36:02,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:02,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:36:02,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:36:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:36:02,128 INFO L87 Difference]: Start difference. First operand 196 states and 284 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:02,200 INFO L93 Difference]: Finished difference Result 353 states and 510 transitions. [2024-10-11 13:36:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:36:02,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2024-10-11 13:36:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:02,203 INFO L225 Difference]: With dead ends: 353 [2024-10-11 13:36:02,203 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 13:36:02,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:36:02,204 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:02,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:36:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 13:36:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 144. [2024-10-11 13:36:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:36:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 206 transitions. [2024-10-11 13:36:02,223 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 206 transitions. Word has length 87 [2024-10-11 13:36:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:02,224 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 206 transitions. [2024-10-11 13:36:02,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 206 transitions. [2024-10-11 13:36:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 13:36:02,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:02,230 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:02,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:36:02,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:02,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:02,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1533219876, now seen corresponding path program 1 times [2024-10-11 13:36:02,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:02,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458528610] [2024-10-11 13:36:02,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:02,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:03,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:03,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:03,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:03,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:03,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:03,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:03,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:03,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:03,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:03,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458528610] [2024-10-11 13:36:03,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458528610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:03,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:03,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:36:03,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105034587] [2024-10-11 13:36:03,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:03,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:36:03,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:03,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:36:03,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:36:03,145 INFO L87 Difference]: Start difference. First operand 144 states and 206 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:03,775 INFO L93 Difference]: Finished difference Result 676 states and 966 transitions. [2024-10-11 13:36:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:36:03,776 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-10-11 13:36:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:03,781 INFO L225 Difference]: With dead ends: 676 [2024-10-11 13:36:03,782 INFO L226 Difference]: Without dead ends: 580 [2024-10-11 13:36:03,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:36:03,784 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 643 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:03,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 2254 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:36:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-11 13:36:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 263. [2024-10-11 13:36:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 232 states have (on average 1.3879310344827587) internal successors, (322), 232 states have internal predecessors, (322), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 376 transitions. [2024-10-11 13:36:03,819 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 376 transitions. Word has length 90 [2024-10-11 13:36:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:03,819 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 376 transitions. [2024-10-11 13:36:03,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:03,820 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 376 transitions. [2024-10-11 13:36:03,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:36:03,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:03,821 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:03,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:36:03,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:03,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1889758172, now seen corresponding path program 1 times [2024-10-11 13:36:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:03,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52252858] [2024-10-11 13:36:03,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:03,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:04,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:04,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52252858] [2024-10-11 13:36:04,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52252858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:04,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:04,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:36:04,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411311464] [2024-10-11 13:36:04,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:04,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:36:04,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:04,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:36:04,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:36:04,332 INFO L87 Difference]: Start difference. First operand 263 states and 376 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:04,528 INFO L93 Difference]: Finished difference Result 602 states and 861 transitions. [2024-10-11 13:36:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:36:04,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-11 13:36:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:04,531 INFO L225 Difference]: With dead ends: 602 [2024-10-11 13:36:04,532 INFO L226 Difference]: Without dead ends: 386 [2024-10-11 13:36:04,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:36:04,533 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 382 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:04,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1128 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:36:04,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-11 13:36:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 256. [2024-10-11 13:36:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 225 states have (on average 1.3866666666666667) internal successors, (312), 225 states have internal predecessors, (312), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 366 transitions. [2024-10-11 13:36:04,555 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 366 transitions. Word has length 91 [2024-10-11 13:36:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:04,556 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 366 transitions. [2024-10-11 13:36:04,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 366 transitions. [2024-10-11 13:36:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:36:04,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:04,559 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:04,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:36:04,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash 127121520, now seen corresponding path program 1 times [2024-10-11 13:36:04,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:04,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535175769] [2024-10-11 13:36:04,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:04,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:04,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535175769] [2024-10-11 13:36:04,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535175769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:04,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:04,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:36:04,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399064690] [2024-10-11 13:36:04,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:04,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:36:04,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:04,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:36:04,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:36:04,962 INFO L87 Difference]: Start difference. First operand 256 states and 366 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:05,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:05,453 INFO L93 Difference]: Finished difference Result 685 states and 983 transitions. [2024-10-11 13:36:05,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:36:05,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-11 13:36:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:05,456 INFO L225 Difference]: With dead ends: 685 [2024-10-11 13:36:05,456 INFO L226 Difference]: Without dead ends: 476 [2024-10-11 13:36:05,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:36:05,458 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 244 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:05,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 757 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:36:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-10-11 13:36:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 266. [2024-10-11 13:36:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 235 states have (on average 1.3829787234042554) internal successors, (325), 235 states have internal predecessors, (325), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 379 transitions. [2024-10-11 13:36:05,478 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 379 transitions. Word has length 91 [2024-10-11 13:36:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:05,479 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 379 transitions. [2024-10-11 13:36:05,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 379 transitions. [2024-10-11 13:36:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:36:05,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:05,481 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:05,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:36:05,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:05,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash -6891986, now seen corresponding path program 1 times [2024-10-11 13:36:05,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:05,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963548266] [2024-10-11 13:36:05,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:05,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:06,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:06,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:06,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:06,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:06,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:06,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:06,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:06,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:06,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963548266] [2024-10-11 13:36:06,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963548266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:06,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:06,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:36:06,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025709286] [2024-10-11 13:36:06,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:06,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:36:06,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:06,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:36:06,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:36:06,183 INFO L87 Difference]: Start difference. First operand 266 states and 379 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:06,973 INFO L93 Difference]: Finished difference Result 775 states and 1110 transitions. [2024-10-11 13:36:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:36:06,973 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-11 13:36:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:06,976 INFO L225 Difference]: With dead ends: 775 [2024-10-11 13:36:06,976 INFO L226 Difference]: Without dead ends: 566 [2024-10-11 13:36:06,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:36:06,980 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 359 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:06,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 907 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:36:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-10-11 13:36:07,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 278. [2024-10-11 13:36:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 247 states have (on average 1.3805668016194332) internal successors, (341), 247 states have internal predecessors, (341), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 395 transitions. [2024-10-11 13:36:07,005 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 395 transitions. Word has length 91 [2024-10-11 13:36:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:07,006 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 395 transitions. [2024-10-11 13:36:07,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 395 transitions. [2024-10-11 13:36:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:36:07,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:07,008 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:07,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:36:07,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:07,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1595239888, now seen corresponding path program 1 times [2024-10-11 13:36:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:07,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305074293] [2024-10-11 13:36:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:07,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:07,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:07,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:07,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:07,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:07,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:07,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:07,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:07,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:07,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:07,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305074293] [2024-10-11 13:36:07,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305074293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:07,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:07,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:36:07,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071043600] [2024-10-11 13:36:07,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:07,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:36:07,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:07,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:36:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:36:07,654 INFO L87 Difference]: Start difference. First operand 278 states and 395 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:08,319 INFO L93 Difference]: Finished difference Result 630 states and 899 transitions. [2024-10-11 13:36:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:36:08,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-11 13:36:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:08,323 INFO L225 Difference]: With dead ends: 630 [2024-10-11 13:36:08,323 INFO L226 Difference]: Without dead ends: 417 [2024-10-11 13:36:08,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:36:08,325 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 270 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:08,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 820 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:36:08,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-11 13:36:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 266. [2024-10-11 13:36:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 235 states have (on average 1.3829787234042554) internal successors, (325), 235 states have internal predecessors, (325), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 379 transitions. [2024-10-11 13:36:08,348 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 379 transitions. Word has length 91 [2024-10-11 13:36:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:08,349 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 379 transitions. [2024-10-11 13:36:08,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 379 transitions. [2024-10-11 13:36:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 13:36:08,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:08,350 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:08,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:36:08,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:08,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2091243841, now seen corresponding path program 1 times [2024-10-11 13:36:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:08,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508832263] [2024-10-11 13:36:08,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:08,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:08,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:08,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:08,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:08,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:08,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:08,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:08,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:08,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:08,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:08,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508832263] [2024-10-11 13:36:08,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508832263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:08,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:08,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:36:08,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100756669] [2024-10-11 13:36:08,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:08,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:36:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:08,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:36:08,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:36:08,924 INFO L87 Difference]: Start difference. First operand 266 states and 379 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:09,189 INFO L93 Difference]: Finished difference Result 452 states and 642 transitions. [2024-10-11 13:36:09,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:36:09,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-10-11 13:36:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:09,191 INFO L225 Difference]: With dead ends: 452 [2024-10-11 13:36:09,191 INFO L226 Difference]: Without dead ends: 356 [2024-10-11 13:36:09,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:36:09,192 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 273 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:09,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1283 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:36:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-11 13:36:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 274. [2024-10-11 13:36:09,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 243 states have (on average 1.382716049382716) internal successors, (336), 243 states have internal predecessors, (336), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 390 transitions. [2024-10-11 13:36:09,210 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 390 transitions. Word has length 92 [2024-10-11 13:36:09,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:09,211 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 390 transitions. [2024-10-11 13:36:09,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:09,211 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 390 transitions. [2024-10-11 13:36:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 13:36:09,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:09,212 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:09,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:36:09,212 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:09,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:09,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1620738666, now seen corresponding path program 1 times [2024-10-11 13:36:09,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:09,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071065606] [2024-10-11 13:36:09,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:09,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:09,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:09,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:09,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:09,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:09,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:09,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:09,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:09,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:09,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:09,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:09,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071065606] [2024-10-11 13:36:09,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071065606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:09,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:09,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:36:09,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956711660] [2024-10-11 13:36:09,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:09,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:36:09,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:09,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:36:09,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:36:09,721 INFO L87 Difference]: Start difference. First operand 274 states and 390 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:09,947 INFO L93 Difference]: Finished difference Result 499 states and 708 transitions. [2024-10-11 13:36:09,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:36:09,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-10-11 13:36:09,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:09,950 INFO L225 Difference]: With dead ends: 499 [2024-10-11 13:36:09,950 INFO L226 Difference]: Without dead ends: 395 [2024-10-11 13:36:09,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:36:09,951 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 366 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:09,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1208 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:36:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-11 13:36:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 270. [2024-10-11 13:36:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 239 states have (on average 1.3765690376569037) internal successors, (329), 239 states have internal predecessors, (329), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 383 transitions. [2024-10-11 13:36:09,972 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 383 transitions. Word has length 92 [2024-10-11 13:36:09,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:09,972 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 383 transitions. [2024-10-11 13:36:09,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 383 transitions. [2024-10-11 13:36:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 13:36:09,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:09,974 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:09,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:36:09,974 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:09,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:09,975 INFO L85 PathProgramCache]: Analyzing trace with hash -892778616, now seen corresponding path program 1 times [2024-10-11 13:36:09,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:09,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387347967] [2024-10-11 13:36:09,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:09,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:10,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:10,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:10,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:10,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:10,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:10,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387347967] [2024-10-11 13:36:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387347967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:10,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:36:10,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017918741] [2024-10-11 13:36:10,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:10,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:36:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:10,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:36:10,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:36:10,622 INFO L87 Difference]: Start difference. First operand 270 states and 383 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:11,348 INFO L93 Difference]: Finished difference Result 761 states and 1083 transitions. [2024-10-11 13:36:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:36:11,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-10-11 13:36:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:11,353 INFO L225 Difference]: With dead ends: 761 [2024-10-11 13:36:11,353 INFO L226 Difference]: Without dead ends: 665 [2024-10-11 13:36:11,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:36:11,354 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 445 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:11,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1758 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:36:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-10-11 13:36:11,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 290. [2024-10-11 13:36:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 259 states have (on average 1.3745173745173744) internal successors, (356), 259 states have internal predecessors, (356), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2024-10-11 13:36:11,373 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 92 [2024-10-11 13:36:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:11,374 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2024-10-11 13:36:11,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2024-10-11 13:36:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 13:36:11,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:11,375 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:11,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:36:11,376 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:11,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:11,376 INFO L85 PathProgramCache]: Analyzing trace with hash -752230006, now seen corresponding path program 1 times [2024-10-11 13:36:11,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:11,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580031849] [2024-10-11 13:36:11,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:11,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:12,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:12,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:12,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:12,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:12,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:12,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:12,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:12,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:12,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580031849] [2024-10-11 13:36:12,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580031849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:12,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:12,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:36:12,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516430662] [2024-10-11 13:36:12,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:12,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:36:12,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:12,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:36:12,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:36:12,429 INFO L87 Difference]: Start difference. First operand 290 states and 410 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:13,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:13,872 INFO L93 Difference]: Finished difference Result 684 states and 968 transitions. [2024-10-11 13:36:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 13:36:13,873 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-10-11 13:36:13,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:13,875 INFO L225 Difference]: With dead ends: 684 [2024-10-11 13:36:13,876 INFO L226 Difference]: Without dead ends: 588 [2024-10-11 13:36:13,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2024-10-11 13:36:13,877 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 657 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:13,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1511 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:36:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-11 13:36:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 287. [2024-10-11 13:36:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 256 states have (on average 1.375) internal successors, (352), 256 states have internal predecessors, (352), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 406 transitions. [2024-10-11 13:36:13,894 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 406 transitions. Word has length 92 [2024-10-11 13:36:13,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:13,895 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 406 transitions. [2024-10-11 13:36:13,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 406 transitions. [2024-10-11 13:36:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 13:36:13,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:13,896 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:13,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:36:13,896 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:13,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:13,897 INFO L85 PathProgramCache]: Analyzing trace with hash 594274326, now seen corresponding path program 1 times [2024-10-11 13:36:13,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:13,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326926788] [2024-10-11 13:36:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:13,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:14,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:14,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326926788] [2024-10-11 13:36:14,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326926788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:14,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213317980] [2024-10-11 13:36:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:14,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:14,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:14,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:14,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:14,078 INFO L87 Difference]: Start difference. First operand 287 states and 406 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:14,140 INFO L93 Difference]: Finished difference Result 436 states and 620 transitions. [2024-10-11 13:36:14,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:36:14,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-10-11 13:36:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:14,143 INFO L225 Difference]: With dead ends: 436 [2024-10-11 13:36:14,143 INFO L226 Difference]: Without dead ends: 338 [2024-10-11 13:36:14,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:36:14,144 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 74 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:14,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 608 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-11 13:36:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 288. [2024-10-11 13:36:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 257 states have (on average 1.3696498054474708) internal successors, (352), 257 states have internal predecessors, (352), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 406 transitions. [2024-10-11 13:36:14,160 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 406 transitions. Word has length 93 [2024-10-11 13:36:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:14,162 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 406 transitions. [2024-10-11 13:36:14,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 406 transitions. [2024-10-11 13:36:14,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 13:36:14,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:14,164 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:14,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:36:14,164 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:14,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash 813129044, now seen corresponding path program 1 times [2024-10-11 13:36:14,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:14,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798111891] [2024-10-11 13:36:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:14,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798111891] [2024-10-11 13:36:14,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798111891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:14,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:14,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:36:14,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515508387] [2024-10-11 13:36:14,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:14,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:36:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:14,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:36:14,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:36:14,343 INFO L87 Difference]: Start difference. First operand 288 states and 406 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:14,365 INFO L93 Difference]: Finished difference Result 403 states and 568 transitions. [2024-10-11 13:36:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:36:14,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-10-11 13:36:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:14,366 INFO L225 Difference]: With dead ends: 403 [2024-10-11 13:36:14,367 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 13:36:14,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:36:14,368 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:14,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 13:36:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2024-10-11 13:36:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 161 states have (on average 1.3416149068322982) internal successors, (216), 161 states have internal predecessors, (216), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:36:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 252 transitions. [2024-10-11 13:36:14,378 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 252 transitions. Word has length 93 [2024-10-11 13:36:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:14,378 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 252 transitions. [2024-10-11 13:36:14,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 252 transitions. [2024-10-11 13:36:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:36:14,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:14,379 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:14,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 13:36:14,379 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:14,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:14,380 INFO L85 PathProgramCache]: Analyzing trace with hash 935829926, now seen corresponding path program 1 times [2024-10-11 13:36:14,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:14,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757358154] [2024-10-11 13:36:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:15,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:15,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:15,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:15,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:15,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-11 13:36:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757358154] [2024-10-11 13:36:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757358154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:15,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:15,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:36:15,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671395135] [2024-10-11 13:36:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:15,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:36:15,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:15,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:36:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:36:15,277 INFO L87 Difference]: Start difference. First operand 182 states and 252 transitions. Second operand has 12 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 13:36:16,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:16,210 INFO L93 Difference]: Finished difference Result 346 states and 474 transitions. [2024-10-11 13:36:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 13:36:16,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 94 [2024-10-11 13:36:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:16,212 INFO L225 Difference]: With dead ends: 346 [2024-10-11 13:36:16,213 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 13:36:16,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:36:16,214 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 397 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:16,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 876 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:36:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 13:36:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 194. [2024-10-11 13:36:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 171 states have (on average 1.3216374269005848) internal successors, (226), 171 states have internal predecessors, (226), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:36:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 262 transitions. [2024-10-11 13:36:16,230 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 262 transitions. Word has length 94 [2024-10-11 13:36:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:16,232 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 262 transitions. [2024-10-11 13:36:16,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 13:36:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 262 transitions. [2024-10-11 13:36:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:36:16,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:16,234 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:16,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 13:36:16,234 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:16,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:16,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1358531752, now seen corresponding path program 1 times [2024-10-11 13:36:16,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:16,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631634929] [2024-10-11 13:36:16,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:16,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:16,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:16,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:16,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:16,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:36:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:16,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:16,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:36:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:16,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:36:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:17,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-11 13:36:17,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631634929] [2024-10-11 13:36:17,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631634929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:17,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:17,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:36:17,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789481520] [2024-10-11 13:36:17,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:17,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:36:17,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:17,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:36:17,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:36:17,041 INFO L87 Difference]: Start difference. First operand 194 states and 262 transitions. Second operand has 12 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 13:36:17,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:17,969 INFO L93 Difference]: Finished difference Result 346 states and 472 transitions. [2024-10-11 13:36:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 13:36:17,970 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 94 [2024-10-11 13:36:17,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:17,971 INFO L225 Difference]: With dead ends: 346 [2024-10-11 13:36:17,971 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 13:36:17,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:36:17,973 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 387 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:17,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 879 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:36:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 13:36:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 190. [2024-10-11 13:36:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 167 states have (on average 1.3173652694610778) internal successors, (220), 167 states have internal predecessors, (220), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:36:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 256 transitions. [2024-10-11 13:36:18,000 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 256 transitions. Word has length 94 [2024-10-11 13:36:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:18,001 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 256 transitions. [2024-10-11 13:36:18,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 13:36:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 256 transitions. [2024-10-11 13:36:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 13:36:18,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:18,002 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:18,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 13:36:18,002 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:18,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:18,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1522702881, now seen corresponding path program 1 times [2024-10-11 13:36:18,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:18,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627528336] [2024-10-11 13:36:18,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:18,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:36:18,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:36:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:36:18,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:36:18,226 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:36:18,228 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:36:18,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 13:36:18,232 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:18,371 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:36:18,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:36:18 BoogieIcfgContainer [2024-10-11 13:36:18,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:36:18,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:36:18,375 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:36:18,375 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:36:18,376 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:35:58" (3/4) ... [2024-10-11 13:36:18,377 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:36:18,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:36:18,379 INFO L158 Benchmark]: Toolchain (without parser) took 20970.50ms. Allocated memory was 176.2MB in the beginning and 524.3MB in the end (delta: 348.1MB). Free memory was 139.1MB in the beginning and 407.1MB in the end (delta: -267.9MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-10-11 13:36:18,379 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:36:18,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.43ms. Allocated memory is still 176.2MB. Free memory was 139.1MB in the beginning and 123.1MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:36:18,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.24ms. Allocated memory is still 176.2MB. Free memory was 123.1MB in the beginning and 119.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:36:18,379 INFO L158 Benchmark]: Boogie Preprocessor took 97.42ms. Allocated memory is still 176.2MB. Free memory was 119.7MB in the beginning and 114.6MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:36:18,380 INFO L158 Benchmark]: RCFGBuilder took 812.50ms. Allocated memory is still 176.2MB. Free memory was 114.6MB in the beginning and 70.5MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-11 13:36:18,380 INFO L158 Benchmark]: TraceAbstraction took 19638.88ms. Allocated memory was 176.2MB in the beginning and 524.3MB in the end (delta: 348.1MB). Free memory was 69.9MB in the beginning and 408.1MB in the end (delta: -338.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 13:36:18,380 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 524.3MB. Free memory was 408.1MB in the beginning and 407.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:36:18,382 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.17ms. Allocated memory is still 176.2MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.43ms. Allocated memory is still 176.2MB. Free memory was 139.1MB in the beginning and 123.1MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.24ms. Allocated memory is still 176.2MB. Free memory was 123.1MB in the beginning and 119.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.42ms. Allocated memory is still 176.2MB. Free memory was 119.7MB in the beginning and 114.6MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 812.50ms. Allocated memory is still 176.2MB. Free memory was 114.6MB in the beginning and 70.5MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19638.88ms. Allocated memory was 176.2MB in the beginning and 524.3MB in the end (delta: 348.1MB). Free memory was 69.9MB in the beginning and 408.1MB in the end (delta: -338.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 524.3MB. Free memory was 408.1MB in the beginning and 407.1MB 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 97, overapproximation of bitwiseAnd at line 62, overapproximation of someBinaryArithmeticFLOAToperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L22] signed short int var_1_1 = -5; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 0; [L24] unsigned char var_1_4 = 0; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned short int var_1_5 = 256; [L26] unsigned short int var_1_5 = 256; [L27] unsigned short int* var_1_5_Pointer = &(var_1_5); [L28] unsigned short int var_1_6 = 44772; [L28] unsigned short int var_1_6 = 44772; [L29] unsigned short int* var_1_6_Pointer = &(var_1_6); [L30] float var_1_7 = 5.9; [L30] float var_1_7 = 5.9; [L31] float* var_1_7_Pointer = &(var_1_7); [L32] float var_1_8 = 7.6; [L32] float var_1_8 = 7.6; [L33] float* var_1_8_Pointer = &(var_1_8); [L34] float var_1_9 = 64.2; [L34] float var_1_9 = 64.2; [L35] float* var_1_9_Pointer = &(var_1_9); [L36] float var_1_10 = 128.75; [L36] float var_1_10 = 128.75; [L37] float* var_1_10_Pointer = &(var_1_10); [L38] unsigned long int var_1_11 = 8; [L38] unsigned long int var_1_11 = 8; [L39] unsigned long int* var_1_11_Pointer = &(var_1_11); [L40] unsigned long int var_1_12 = 3135928546; [L40] unsigned long int var_1_12 = 3135928546; [L41] unsigned long int* var_1_12_Pointer = &(var_1_12); [L42] signed short int last_1_var_1_1 = -5; [L43] unsigned long int last_1_var_1_11 = 8; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L93] EXPR \read(var_1_1) [L93] last_1_var_1_1 = var_1_1 [L94] EXPR \read(var_1_11) [L94] last_1_var_1_11 = var_1_11 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L76] var_1_4 = __VERIFIER_nondet_uchar() [L77] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] var_1_6 = __VERIFIER_nondet_ushort() [L80] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] var_1_8 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_8) [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F [L83] EXPR \read(var_1_8) [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR (var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR (var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] var_1_9 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_9) [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F [L85] EXPR \read(var_1_9) [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_10 = __VERIFIER_nondet_float() [L87] EXPR \read(var_1_10) [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F [L87] EXPR \read(var_1_10) [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] var_1_12 = __VERIFIER_nondet_ulong() [L89] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] RET updateVariables() [L106] CALL step() [L47] signed long int stepLocal_0 = last_1_var_1_1; [L48] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L48] COND TRUE (*(var_1_4_Pointer)) [L49] (*(var_1_5_Pointer)) = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR \read(*var_1_5_Pointer) [L55] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] COND TRUE (*(var_1_5_Pointer)) == (*(var_1_5_Pointer)) [L56] EXPR \read(*var_1_5_Pointer) [L56] (*(var_1_1_Pointer)) = ((*(var_1_5_Pointer)) + -16) [L62] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] EXPR (*(var_1_5_Pointer)) & last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND TRUE last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11) [L63] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)) [L63] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] (*(var_1_11_Pointer)) = ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))) [L71] EXPR \read(*var_1_1_Pointer) [L71] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L71] COND TRUE (*(var_1_1_Pointer)) < (*(var_1_5_Pointer)) [L72] EXPR \read(*var_1_8_Pointer) [L72] EXPR \read(*var_1_9_Pointer) [L72] EXPR \read(*var_1_10_Pointer) [L72] (*(var_1_7_Pointer)) = (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1) [L97] EXPR \read(*var_1_1_Pointer) [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) [L97] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1) [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) [L97] EXPR \read(*var_1_1_Pointer) [L97] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1 [L97] EXPR \read(*var_1_7_Pointer) [L97] EXPR \read(*var_1_8_Pointer) [L97] EXPR \read(*var_1_9_Pointer) [L97] EXPR \read(*var_1_10_Pointer) [L97] EXPR ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97-L98] return (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 19, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4878 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4878 mSDsluCounter, 16245 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13084 mSDsCounter, 505 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6685 IncrementalHoareTripleChecker+Invalid, 7190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 505 mSolverCounterUnsat, 3161 mSDtfsCounter, 6685 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 584 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=13, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 2343 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 1720 NumberOfCodeBlocks, 1720 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1606 ConstructedInterpolants, 0 QuantifiedInterpolants, 7601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 2592/2592 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-11 13:36:18,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:36:20,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:36:20,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:36:20,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:36:20,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:36:20,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:36:20,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:36:20,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:36:20,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:36:20,731 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:36:20,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:36:20,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:36:20,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:36:20,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:36:20,735 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:36:20,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:36:20,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:36:20,736 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:36:20,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:36:20,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:36:20,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:36:20,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:36:20,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:36:20,738 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:36:20,738 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:36:20,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:36:20,739 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:36:20,739 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:36:20,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:36:20,740 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:36:20,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:36:20,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:36:20,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:36:20,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:36:20,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:36:20,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:36:20,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:36:20,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:36:20,742 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:36:20,742 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:36:20,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:36:20,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:36:20,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:36:20,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:36:20,744 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:36:20,744 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-clean/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-clean/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 -> e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf [2024-10-11 13:36:21,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:36:21,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:36:21,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:36:21,111 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:36:21,113 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:36:21,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2024-10-11 13:36:22,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:36:22,853 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:36:22,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2024-10-11 13:36:22,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/72985f5db/a697879476164f61a6950427f67781b9/FLAG105e5d694 [2024-10-11 13:36:22,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/72985f5db/a697879476164f61a6950427f67781b9 [2024-10-11 13:36:22,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:36:22,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:36:22,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:36:22,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:36:22,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:36:22,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:22" (1/1) ... [2024-10-11 13:36:22,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53833499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:22, skipping insertion in model container [2024-10-11 13:36:22,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:22" (1/1) ... [2024-10-11 13:36:22,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:36:23,095 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-p_file-22.i[916,929] [2024-10-11 13:36:23,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:36:23,187 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:36:23,197 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-p_file-22.i[916,929] [2024-10-11 13:36:23,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:36:23,262 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:36:23,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23 WrapperNode [2024-10-11 13:36:23,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:36:23,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:36:23,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:36:23,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:36:23,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (1/1) ... [2024-10-11 13:36:23,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (1/1) ... [2024-10-11 13:36:23,334 INFO L138 Inliner]: procedures = 36, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2024-10-11 13:36:23,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:36:23,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:36:23,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:36:23,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:36:23,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (1/1) ... [2024-10-11 13:36:23,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (1/1) ... [2024-10-11 13:36:23,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (1/1) ... [2024-10-11 13:36:23,400 INFO L175 MemorySlicer]: Split 96 memory accesses to 11 slices as follows [2, 8, 8, 17, 16, 3, 8, 10, 8, 8, 8]. 18 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 2, 1, 2, 1, 1, 1, 1, 1, 3, 1]. [2024-10-11 13:36:23,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (1/1) ... [2024-10-11 13:36:23,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (1/1) ... [2024-10-11 13:36:23,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (1/1) ... [2024-10-11 13:36:23,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (1/1) ... [2024-10-11 13:36:23,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (1/1) ... [2024-10-11 13:36:23,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (1/1) ... [2024-10-11 13:36:23,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:36:23,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:36:23,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:36:23,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:36:23,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (1/1) ... [2024-10-11 13:36:23,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:36:23,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:36:23,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:36:23,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:36:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:36:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:36:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:36:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:36:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:36:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:36:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:36:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:36:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-11 13:36:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-11 13:36:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-11 13:36:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-11 13:36:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:36:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:36:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:36:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:36:23,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:36:23,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:36:23,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-11 13:36:23,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-11 13:36:23,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-11 13:36:23,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-11 13:36:23,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-11 13:36:23,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:36:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:36:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:36:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:36:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:36:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:36:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:36:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-11 13:36:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-11 13:36:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-11 13:36:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-11 13:36:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:36:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:36:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:36:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:36:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:36:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 13:36:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-11 13:36:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-11 13:36:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-11 13:36:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-11 13:36:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-11 13:36:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:36:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:36:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:36:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:36:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:36:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:36:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-11 13:36:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-11 13:36:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-11 13:36:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-11 13:36:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-11 13:36:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:36:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:36:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:36:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:36:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:36:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 13:36:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-11 13:36:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-11 13:36:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-11 13:36:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-11 13:36:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-11 13:36:23,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:36:23,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:36:23,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:36:23,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:36:23,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:36:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:36:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 13:36:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-11 13:36:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-11 13:36:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-11 13:36:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-11 13:36:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:36:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:36:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:36:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:36:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:36:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:36:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-11 13:36:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-11 13:36:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-11 13:36:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-11 13:36:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-11 13:36:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:36:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:36:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:36:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:36:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:36:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:36:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-11 13:36:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-11 13:36:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-11 13:36:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-11 13:36:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-11 13:36:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:36:23,594 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:36:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:36:23,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:36:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:36:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:36:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:36:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:36:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:36:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:36:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:36:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-11 13:36:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-11 13:36:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-11 13:36:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-11 13:36:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:36:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:36:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:36:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:36:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:36:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:36:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 13:36:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-11 13:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-11 13:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-11 13:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-11 13:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 13:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-11 13:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-11 13:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-11 13:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-11 13:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-11 13:36:23,861 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:36:23,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:36:25,592 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-10-11 13:36:25,592 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:36:25,646 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:36:25,648 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:36:25,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:25 BoogieIcfgContainer [2024-10-11 13:36:25,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:36:25,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:36:25,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:36:25,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:36:25,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:36:22" (1/3) ... [2024-10-11 13:36:25,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c878846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:25, skipping insertion in model container [2024-10-11 13:36:25,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:23" (2/3) ... [2024-10-11 13:36:25,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c878846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:25, skipping insertion in model container [2024-10-11 13:36:25,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:25" (3/3) ... [2024-10-11 13:36:25,662 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-22.i [2024-10-11 13:36:25,675 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:36:25,676 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:36:25,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:36:25,737 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;@31885b56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:36:25,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:36:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:36:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 13:36:25,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:25,751 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:25,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash -929713180, now seen corresponding path program 1 times [2024-10-11 13:36:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:25,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071018945] [2024-10-11 13:36:25,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:25,767 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-11 13:36:25,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:25,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:25,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:26,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:36:26,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 13:36:26,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:26,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:26,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071018945] [2024-10-11 13:36:26,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071018945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:26,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:26,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:36:26,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909251507] [2024-10-11 13:36:26,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:26,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:36:26,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:26,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:36:26,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:36:26,363 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 13:36:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:26,430 INFO L93 Difference]: Finished difference Result 178 states and 276 transitions. [2024-10-11 13:36:26,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:36:26,437 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-11 13:36:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:26,444 INFO L225 Difference]: With dead ends: 178 [2024-10-11 13:36:26,445 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 13:36:26,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-11 13:36:26,464 INFO L432 NwaCegarLoop]: 120 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, 120 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-11 13:36:26,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:26,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 13:36:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 13:36:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.394736842105263) internal successors, (106), 76 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:36:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2024-10-11 13:36:26,522 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 84 [2024-10-11 13:36:26,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:26,523 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2024-10-11 13:36:26,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 13:36:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2024-10-11 13:36:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 13:36:26,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:26,529 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:26,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:26,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:26,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:26,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:26,731 INFO L85 PathProgramCache]: Analyzing trace with hash -819254314, now seen corresponding path program 1 times [2024-10-11 13:36:26,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672683453] [2024-10-11 13:36:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:26,732 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-11 13:36:26,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:26,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:26,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:27,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:36:27,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 13:36:27,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:27,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:27,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672683453] [2024-10-11 13:36:27,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672683453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:27,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:27,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:36:27,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822643170] [2024-10-11 13:36:27,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:27,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:36:27,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:27,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:36:27,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:36:27,176 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 13:36:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:27,240 INFO L93 Difference]: Finished difference Result 175 states and 250 transitions. [2024-10-11 13:36:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:36:27,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2024-10-11 13:36:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:27,244 INFO L225 Difference]: With dead ends: 175 [2024-10-11 13:36:27,244 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 13:36:27,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 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-11 13:36:27,246 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 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-11 13:36:27,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 13:36:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 13:36:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:36:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-10-11 13:36:27,272 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 87 [2024-10-11 13:36:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:27,275 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-10-11 13:36:27,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 13:36:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-10-11 13:36:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 13:36:27,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:27,278 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:27,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 13:36:27,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:27,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:27,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:27,480 INFO L85 PathProgramCache]: Analyzing trace with hash 78138964, now seen corresponding path program 1 times [2024-10-11 13:36:27,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:27,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098249303] [2024-10-11 13:36:27,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:27,481 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-11 13:36:27,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:27,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:27,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:27,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:36:27,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:28,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:36:28,808 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2024-10-11 13:36:28,809 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 1 case distinctions, treesize of input 43 treesize of output 46 [2024-10-11 13:36:28,936 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 76 treesize of output 60 [2024-10-11 13:36:28,944 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 63 treesize of output 51 [2024-10-11 13:36:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:28,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:28,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:28,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098249303] [2024-10-11 13:36:28,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098249303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:28,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:28,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:36:28,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142865300] [2024-10-11 13:36:28,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:28,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:36:28,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:28,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:36:28,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:36:28,991 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:30,338 INFO L93 Difference]: Finished difference Result 531 states and 754 transitions. [2024-10-11 13:36:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:36:30,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2024-10-11 13:36:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:30,343 INFO L225 Difference]: With dead ends: 531 [2024-10-11 13:36:30,343 INFO L226 Difference]: Without dead ends: 443 [2024-10-11 13:36:30,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:36:30,346 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 632 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:30,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1618 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 13:36:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-11 13:36:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 429. [2024-10-11 13:36:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 378 states have (on average 1.3888888888888888) internal successors, (525), 378 states have internal predecessors, (525), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 13:36:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 615 transitions. [2024-10-11 13:36:30,428 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 615 transitions. Word has length 87 [2024-10-11 13:36:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:30,428 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 615 transitions. [2024-10-11 13:36:30,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 615 transitions. [2024-10-11 13:36:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 13:36:30,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:30,434 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:30,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 13:36:30,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:30,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:30,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:30,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1392571364, now seen corresponding path program 1 times [2024-10-11 13:36:30,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:30,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668735182] [2024-10-11 13:36:30,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:30,637 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-11 13:36:30,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:30,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:30,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:31,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:36:31,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:31,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:36:31,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 13:36:31,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-11 13:36:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:31,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:31,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:31,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668735182] [2024-10-11 13:36:31,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668735182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:31,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:31,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:31,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101022695] [2024-10-11 13:36:31,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:31,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:36:31,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:31,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:36:31,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:36:31,209 INFO L87 Difference]: Start difference. First operand 429 states and 615 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:31,597 INFO L93 Difference]: Finished difference Result 782 states and 1109 transitions. [2024-10-11 13:36:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:36:31,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2024-10-11 13:36:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:31,601 INFO L225 Difference]: With dead ends: 782 [2024-10-11 13:36:31,601 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 13:36:31,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:36:31,605 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 396 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:31,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1030 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:36:31,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 13:36:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 260. [2024-10-11 13:36:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 229 states have (on average 1.3799126637554586) internal successors, (316), 229 states have internal predecessors, (316), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 370 transitions. [2024-10-11 13:36:31,644 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 370 transitions. Word has length 88 [2024-10-11 13:36:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:31,644 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 370 transitions. [2024-10-11 13:36:31,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 370 transitions. [2024-10-11 13:36:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 13:36:31,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:31,646 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:31,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 13:36:31,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:31,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:31,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:31,847 INFO L85 PathProgramCache]: Analyzing trace with hash 355644872, now seen corresponding path program 1 times [2024-10-11 13:36:31,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:31,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049311383] [2024-10-11 13:36:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:31,848 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-11 13:36:31,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:31,851 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:31,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:32,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 13:36:32,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:32,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:32,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:32,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049311383] [2024-10-11 13:36:32,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049311383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:32,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:32,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:36:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859062364] [2024-10-11 13:36:32,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:32,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:36:32,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:32,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:36:32,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:36:32,253 INFO L87 Difference]: Start difference. First operand 260 states and 370 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:32,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:32,298 INFO L93 Difference]: Finished difference Result 533 states and 759 transitions. [2024-10-11 13:36:32,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:36:32,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2024-10-11 13:36:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:32,301 INFO L225 Difference]: With dead ends: 533 [2024-10-11 13:36:32,301 INFO L226 Difference]: Without dead ends: 274 [2024-10-11 13:36:32,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:36:32,303 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 20 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:32,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 233 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-11 13:36:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 191. [2024-10-11 13:36:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 170 states have (on average 1.3705882352941177) internal successors, (233), 170 states have internal predecessors, (233), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:36:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 269 transitions. [2024-10-11 13:36:32,319 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 269 transitions. Word has length 88 [2024-10-11 13:36:32,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:32,320 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 269 transitions. [2024-10-11 13:36:32,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 269 transitions. [2024-10-11 13:36:32,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 13:36:32,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:32,323 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:32,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 13:36:32,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:32,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:32,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:32,525 INFO L85 PathProgramCache]: Analyzing trace with hash 478526521, now seen corresponding path program 1 times [2024-10-11 13:36:32,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:32,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155201798] [2024-10-11 13:36:32,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:32,526 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-11 13:36:32,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:32,529 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:32,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:32,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:36:32,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:32,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:36:33,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:36:33,112 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 45 treesize of output 33 [2024-10-11 13:36:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:33,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:33,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:33,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155201798] [2024-10-11 13:36:33,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155201798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:33,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:33,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:36:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345506994] [2024-10-11 13:36:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:33,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:36:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:36:33,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:36:33,147 INFO L87 Difference]: Start difference. First operand 191 states and 269 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:33,494 INFO L93 Difference]: Finished difference Result 356 states and 495 transitions. [2024-10-11 13:36:33,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:36:33,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-10-11 13:36:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:33,497 INFO L225 Difference]: With dead ends: 356 [2024-10-11 13:36:33,497 INFO L226 Difference]: Without dead ends: 268 [2024-10-11 13:36:33,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:36:33,500 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 231 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:33,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 940 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:36:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-11 13:36:33,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 199. [2024-10-11 13:36:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 178 states have (on average 1.3707865168539326) internal successors, (244), 178 states have internal predecessors, (244), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:36:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 280 transitions. [2024-10-11 13:36:33,513 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 280 transitions. Word has length 89 [2024-10-11 13:36:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:33,514 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 280 transitions. [2024-10-11 13:36:33,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 280 transitions. [2024-10-11 13:36:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 13:36:33,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:33,516 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:33,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:33,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:33,721 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:33,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1061511310, now seen corresponding path program 1 times [2024-10-11 13:36:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:33,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941784960] [2024-10-11 13:36:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:33,722 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-11 13:36:33,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:33,723 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:33,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:36:34,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:34,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:36:34,202 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-11 13:36:34,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-11 13:36:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:34,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:34,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:34,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941784960] [2024-10-11 13:36:34,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941784960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:34,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:34,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:34,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685724530] [2024-10-11 13:36:34,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:34,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:36:34,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:34,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:36:34,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:36:34,264 INFO L87 Difference]: Start difference. First operand 199 states and 280 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:34,569 INFO L93 Difference]: Finished difference Result 403 states and 561 transitions. [2024-10-11 13:36:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:36:34,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-10-11 13:36:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:34,571 INFO L225 Difference]: With dead ends: 403 [2024-10-11 13:36:34,571 INFO L226 Difference]: Without dead ends: 307 [2024-10-11 13:36:34,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:36:34,575 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 320 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:34,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 964 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:36:34,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-11 13:36:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 195. [2024-10-11 13:36:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 174 states have internal predecessors, (237), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:36:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 273 transitions. [2024-10-11 13:36:34,589 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 273 transitions. Word has length 89 [2024-10-11 13:36:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:34,589 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 273 transitions. [2024-10-11 13:36:34,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 273 transitions. [2024-10-11 13:36:34,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 13:36:34,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:34,592 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:34,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:34,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:34,793 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:34,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:34,793 INFO L85 PathProgramCache]: Analyzing trace with hash -86363027, now seen corresponding path program 1 times [2024-10-11 13:36:34,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:34,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010276313] [2024-10-11 13:36:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:34,794 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-11 13:36:34,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:34,795 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:34,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:36:35,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:35,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 13:36:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 13:36:35,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:36:35,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:36:35,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-10-11 13:36:36,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:36,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010276313] [2024-10-11 13:36:36,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010276313] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:36:36,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [312219577] [2024-10-11 13:36:36,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:36,144 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:36:36,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:36:36,146 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:36:36,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-10-11 13:36:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:36:36,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:37,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:36:37,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-11 13:36:37,247 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 74 treesize of output 58 [2024-10-11 13:36:37,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2024-10-11 13:36:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:37,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:37,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [312219577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:37,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:36:37,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-10-11 13:36:37,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787831017] [2024-10-11 13:36:37,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:37,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:36:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:37,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:36:37,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:36:37,313 INFO L87 Difference]: Start difference. First operand 195 states and 273 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:38,241 INFO L93 Difference]: Finished difference Result 691 states and 968 transitions. [2024-10-11 13:36:38,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:36:38,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-10-11 13:36:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:38,245 INFO L225 Difference]: With dead ends: 691 [2024-10-11 13:36:38,247 INFO L226 Difference]: Without dead ends: 603 [2024-10-11 13:36:38,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:36:38,248 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 376 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:38,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1695 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:36:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-11 13:36:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 255. [2024-10-11 13:36:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 224 states have (on average 1.3571428571428572) internal successors, (304), 224 states have internal predecessors, (304), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 358 transitions. [2024-10-11 13:36:38,267 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 358 transitions. Word has length 90 [2024-10-11 13:36:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:38,267 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 358 transitions. [2024-10-11 13:36:38,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:38,268 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 358 transitions. [2024-10-11 13:36:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 13:36:38,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:38,269 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:38,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-10-11 13:36:38,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 13:36:38,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:38,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:38,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1891801361, now seen corresponding path program 1 times [2024-10-11 13:36:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:38,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777125672] [2024-10-11 13:36:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:38,671 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-11 13:36:38,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:38,672 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:38,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:39,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:36:39,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:39,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-11 13:36:39,088 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 66 treesize of output 54 [2024-10-11 13:36:39,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-10-11 13:36:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:39,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:39,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777125672] [2024-10-11 13:36:39,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777125672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:39,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:39,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:39,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211750324] [2024-10-11 13:36:39,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:39,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:39,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:39,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:39,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:39,109 INFO L87 Difference]: Start difference. First operand 255 states and 358 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:39,258 INFO L93 Difference]: Finished difference Result 430 states and 604 transitions. [2024-10-11 13:36:39,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:36:39,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-10-11 13:36:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:39,260 INFO L225 Difference]: With dead ends: 430 [2024-10-11 13:36:39,261 INFO L226 Difference]: Without dead ends: 342 [2024-10-11 13:36:39,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 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-11 13:36:39,261 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 108 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:39,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 601 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:36:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-11 13:36:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 209. [2024-10-11 13:36:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 188 states have (on average 1.3617021276595744) internal successors, (256), 188 states have internal predecessors, (256), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:36:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 292 transitions. [2024-10-11 13:36:39,275 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 292 transitions. Word has length 90 [2024-10-11 13:36:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:39,275 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 292 transitions. [2024-10-11 13:36:39,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 292 transitions. [2024-10-11 13:36:39,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:36:39,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:39,276 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:39,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 13:36:39,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:39,477 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:39,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:39,478 INFO L85 PathProgramCache]: Analyzing trace with hash -567649376, now seen corresponding path program 1 times [2024-10-11 13:36:39,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:39,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893928273] [2024-10-11 13:36:39,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:39,478 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-11 13:36:39,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:39,479 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:39,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 13:36:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:39,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:36:39,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:40,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:36:40,349 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 27 [2024-10-11 13:36:40,373 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-11 13:36:40,374 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 1 case distinctions, treesize of input 32 treesize of output 35 [2024-10-11 13:36:40,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-11 13:36:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:36:40,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:40,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:40,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893928273] [2024-10-11 13:36:40,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893928273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:40,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:40,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:36:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791799398] [2024-10-11 13:36:40,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:40,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:36:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:40,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:36:40,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:36:40,427 INFO L87 Difference]: Start difference. First operand 209 states and 292 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:41,818 INFO L93 Difference]: Finished difference Result 401 states and 560 transitions. [2024-10-11 13:36:41,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:36:41,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-11 13:36:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:41,821 INFO L225 Difference]: With dead ends: 401 [2024-10-11 13:36:41,821 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 13:36:41,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:36:41,822 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 288 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:41,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 959 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 13:36:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 13:36:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2024-10-11 13:36:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 264 states have (on average 1.3636363636363635) internal successors, (360), 264 states have internal predecessors, (360), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:36:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 414 transitions. [2024-10-11 13:36:41,837 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 414 transitions. Word has length 91 [2024-10-11 13:36:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:41,837 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 414 transitions. [2024-10-11 13:36:41,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:36:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 414 transitions. [2024-10-11 13:36:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:36:41,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:41,839 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:41,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 13:36:42,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:42,039 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:42,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1952310558, now seen corresponding path program 1 times [2024-10-11 13:36:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:42,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686840933] [2024-10-11 13:36:42,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:42,040 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-11 13:36:42,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:42,043 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:36:42,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process